Vector-Erase in C++ - Hacker Rank Solution
Problem
You are provided with a vector of N integers. Then, you are given 2 queries. For the first query, you are provided with 1 integer, which denotes a position in the vector. The value at this position in the vector needs to be erased. The next query consists of 2 integers denoting a range of the positions in the vector. The elements which fall under that range should be removed. The second query is performed on the updated vector which we get after performing the first query.
The following are some useful vector functions:
erase(int position) :
Removes the element present at position. Ex: v.erase(v.begin()+4); (erases the fifth element of the vector v)
erase(int start,int end) :
Removes the elements in the range from start to end inclusive of the start and exclusive of the end. Ex:v.erase(v.begin()+2,v.begin()+5);(erases all the elements from the third element to the fifth element.)
Input Format :
The first line of the input contains an integer N. The next line contains N
space separated integers(1-based index).The third line contains a single
integer x, denoting the position of an element that should be removed from the
vector. The fourth line contains two integers a and b denoting the range that
should be erased from the vector inclusive of a and exclusive of b.
Constraints :
- 1 <= N <= 10^5
- 1<= x <= N
- 1<= a < b <= N
Output Format :
Print the size of the vector in the first line and the elements of the vector
after the two erase operations in the second line separated by space.
Sample Input :
6 1 4 6 2 8 9 2 2 4
Sample Output :
3 1 8 9
Explanation :
The first query is to erase the 2nd element in the vector, which is 4. Then,
modifed vector is {1 6 2 8 9}, we want to remove the range of 2~4, which means
the 2nd and 3rd elements should be removed. Then 6 and 2 in the modified
vector are removed and we finally get {1 8 9}
Solution :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 | //Vector-Erase in C++ - Hacker Rank Solution #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> using namespace std; int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ /* Vector-Erase in C++ - Hacker Rank Solution START */ vector<int> v ; int x,i,j; int n; cin>>n; for(i =0 ; i<n ; i++) { cin>>x; v.push_back(x); } int q1, q2, q3; cin>>q1; cin>>q2>>q3; v.erase (v.begin()+(q1-1)); v.erase(v.begin()+q2-1 , v.begin()+q3-1); cout << v.size() << endl; for(j =0 ; j< v.size() ; j++) { cout << v.at(j) << " " ; } /* Vector-Erase in C++ - Hacker Rank Solution END */ return 0; } |
Disclaimer :-
the above hole problem statement is given by hackerrank.com but the solution is generated by the codeworld19 authority if any of the query regarding this post or website fill the following contact form thank you.
CodeWorld19
Hey, I am Parthe Omkar
you need to create a vector with the given size n, else segmentation fault will pop up