#include <algorithm><br /> #include <vector></p> <p>// using the erase-remove idiom</p> <p>std::vector<int> vec {2, 4, 6, 8};<br /> int value = 8 // value to be removed<br /> vec.erase(std::remove(vec.begin(), vec.end(), value), vec.end());

//me<br /> vec.erase(vec.begin() + index); //index 0 means first element and so on

std::vector<int> v;<br /> // fill it up somehow<br /> v.erase(std::remove(v.begin(), v.end(), 99), v.end());<br /> // really remove all elements with value 99

#include <algorithm><br /> …<br /> vec.erase(std::remove(vec.begin(), vec.end(), 8), vec.end());

#include <vector><br /> #include <algorithm><br /> #include <iostream></p> <p>int main()<br /> {<br /> //C++20 std::erase function wraps erase-remove idiom</p> <p> std::vector<int> ivec{ 1, 5, 7, 2, 1, 3, 1, 7, 1 };<br /> auto n = erase(ivec, 1); //ADL<br /> std::cout << n << ” elements erased\n”;<br /> for (auto i : ivec)<br /> std::cout << i << ‘ ‘;<br /> }

vector.erase(position) // remove certain position<br /> // or<br /> vector.erase(left,right) // remove positions within range<br />

</p> <p>// erase element from vector by its index<br /> vector<string> strs {“first”, “second”, “third”, “last”};</p> <p> string element = “third”; // the element which will be erased<br /> for(int i=0;i<strs.size();i++)<br /> {<br /> if(strs[i] == element)<br /> strs.erase(strs.begin()+i);<br /> }</p> <p>

#include<iostream><br /> #include<vector><br /> using namespace std;<br /> int main(){<br /> //Creation of integer vector<br /> vector<int> vectorArray ;<br /> for(int i=1;i<10;i++){<br /> vectorArray.push_back(i);<br /> }<br /> //vector elements are 1,2,3,4,5,6,7,8,9</p> <p> vectorArray.pop_back();<br /> for(int i=0;i<vectorArray.size();i++){<br /> cout<<vectorArray[i]<<” “;<br /> }<br /> //vector elements are 1,2,3,4,5,6,7,8<br /> cout<<endl;</p> <p> vectorArray.clear();<br /> // No elements are left in vector array</p> <p> return 0;<br /> }