How to Remove Last Occurrence of an Element from a Vector in C++?

How to Remove Elements from a Vector while Iterating in C++?

Last Updated : 03 Dec, 2024

Erasing elements from a vector while iterating can be challenging because removing an element may invalidate iterators or change the size of the vector. In this article, we will learn how to erase an elements from vector while iterating in C++.

To efficiently remove elements from a vector while iterating, we use an iterator to traverse the vector. The vector erase() method removes an element and returns an iterator pointing to the next element which we assign to our current iterator. If no element is erased, we simply increment the iterator to continue the iteration.

C++

#include <bits/stdc++.h>
using namespace std;

int main() {
    vector<int> v = {1, 3, 2, 4, 5, 8};

    // Erase elements while iterating
    for (auto it = v.begin(); it != v.end();) {

        // Remove even elements
        if (*it % 2 == 0)
            it = v.erase(it);
        else
            it++;
    }

    for (auto i : v)
        cout << i << " ";
    return 0;
}

Output

1 3 5

Explanation: In the above code, we remove all even elements from the vector. When an even element is found during iteration, we erase it using vector erase() and update the iterator with the returned value to avoid skipping any elements. If the element is not even, we simply increment the iterator to move to the next element.

How to Remove Last Occurrence of an Element from a Vector in C++?

A

anmolpanxq

Improve

Article Tags :

Practice Tags :

Similar Reads

How to Remove an Element from Vector in C++?

In this article, we will learn how to remove a given element from the vector in C++. The most straightforward method to delete a particular element from a vector is to use the vector erase() method. Let's look at a simple example that shows how to use this function: [GFGTABS] C++ #include <bits/s

How to Remove Last Element from Vector in C++?

Given a vector of n elements, the task is to remove the last element from the vector in C++. The most efficient method to remove the last element from vector is by using vector pop_back() method. Letâ€™s take a look at a simple example: [GFGTABS] C++ #include <bits/stdc++.h> using namespace std;

How to Insert Elements from Vectors to a Map in C++?

In C++, vectors are the dynamic array that stores data in contiguous memory locations while maps are the data containers that store the key-value pair and are sorted on the basis of the key. In this article, we will learn how to efficiently map elements from vectors to a map in C++. Example Input: v

How to Remove Duplicates from a Vector While Preserving Order in C++?

A vector in C++ is used for storing values of certain data types in contiguous memory locations like arrays. In this article, we will learn how to remove duplicates from an unsorted vector while keeping the original order of elements in C++. Example Input:myVector = {1, 2, 5, 4, 3, 2, 1, 5, 6, 5}Out

How to Remove Last Occurrence of an Element from a Vector in C++?

In C++, vectors are the same as dynamic arrays with the ability to resize automatically when an element is inserted or deleted, with their storage being handled automatically by the container. In this article, we will learn how to remove the last occurrence of a specific element in a vector. Input:

How to Remove an Element from a List in C++?

In C++, the STL provides a std::list container that represents a doubly linked list to store the sequential data in non-contiguous memory locations. In this article, we will learn how to remove an element from a list in C++. Example: Input: myList = {1, 2, 3, 4, 5, 6, 7, 8} Target = 5 Output: // rem

How to Remove an Element from a Set in C++?

In C++, sets are a type of associative container in which each element has to be unique. The values are stored in a specific sorted order i.e. either ascending or descending. In this article, we will see how to remove specific elements from a set in C++. Example Input: set = {100,120,12,56,78,9,32,4

How to Remove Duplicates from a Vector in C++?

In this article, we will learn how to remove the duplicates from the vector in C++. The recommended way to remove the duplicates from the vector is by using sort() with unique() to move all the duplicate elements at the end and then remove them using vector erase(). Letâ€™s take a look at an example:

How to Remove Second Occurrence of an Element from a Vector in C++?

In C++, vectors are the dynamic arrays that store the data in the contiguous memory location. It can also contain multiple copies of the same element. In this article, we will learn how to remove the second occurrence of an element from a vector in C++. Example: Input: myVector = {1, 2, 3, 4, 2, 5,

How to Delete Multiple Elements from a Vector in C++?

In this article, we will learn how to erase multiple elements from a vector in C++. The easiest and most efficient method to delete the multiple elements from the vector is by using vector erase() method. Letâ€™s take a look at an example: [GFGTABS] C++ #include <bits/stdc++.h> using namespace s