Vector-Erase

Sort by

recency

|

417 Discussions

|

  • + 0 comments

    int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int n; cin >> n; // vecot declare... vector v (n); // element input.. for(int i = 0; i < v.size(); i++) { cin >> v[i]; } int pos; cin >> pos; // delete element 4 (index-2) v.erase(v.begin() + (pos - 1)); int a, b; cin >> a >> b; // range delete 2 to 4 v.erase(v.begin() + (a-1), v.begin() + (b-1)); cout << v.size() << endl; for(int p: v) { cout << p << " "; } cout << endl; return 0; }

  • + 0 comments
    #include <iostream>
    #include <vector>
    
    using namespace std;
    
    int indexify(int i)
    {
        return --i;
    }
    
    int main()
    {
        int n;
        cin >> n;
    
        vector<int> numbers;
    
        while (n > 0)
        {
            int number;
            cin >> number;
            numbers.push_back(number);
            n--;
        }
    
        int element_nr;
        cin >> element_nr;
    
        numbers.erase(numbers.begin() + indexify(element_nr));
    
        int start, end;
        cin >> start >> end;
    
        numbers.erase(numbers.begin() + indexify(start), numbers.begin() + indexify(end));
    
        cout << numbers.size() << endl;
        for (int i = 0; i < numbers.size(); i++)
            cout << numbers[i] << " ";
    }
    
  • + 0 comments

    include

    include

    include

    include

    include

    using namespace std;

    int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ int n; cin>>n;
    vector v(n);

    for(int i=0; i<n; i++){
        cin>> v[i];
    } 
    int s;
    cin>> s ;
    
    v.erase(v.begin() + (s-1));
    
    int a,b;
    cin>> a >> b;
    
    v.erase(v.begin() + (a-1), v.begin()+(b-1));
    
    cout<<v.size()<<endl;
    for(int i=0; i<v.size(); i++){
        cout<<v[i]<<" ";
    }
    return 0;
    

    }

  • + 0 comments

    Here is Vector-Erase problem solution in C++ - https://programmingoneonone.com/hackerrank-vector-erase-solution-in-cpp.html

  • + 0 comments

    include

    include

    include

    include

    include

    using namespace std;

    int main() { int N; cin>>N;//taking the size of vector vectorv; int i; //giving elements to the vector for (i=0; i>e; v.push_back(e); } int x; cin>>x; //erasing the vector v.erase(v.begin()+(x-1)); int a,b; cin>>a; cin>>b; //position deleting v.erase(v.begin()+(a-1),v.begin()+(b-1)); vector::iterator it; int count=0; for (it=v.begin(); it