How to use containers and iterators in C++

Containers and iterators are important concepts in C++ used for storing and accessing data. Containers are data structures used to store multiple elements, while iterators are pointer-like objects used to iterate through the elements in a container.

Here is a simple example demonstrating how to use containers and iterators:

#include <iostream>
#include <vector>

int main() {
    // 创建一个vector容器
    std::vector<int> vec = {1, 2, 3, 4, 5};

    // 使用迭代器遍历容器中的元素
    for(std::vector<int>::iterator it = vec.begin(); it != vec.end(); ++it) {
        std::cout << *it << " ";
    }

    std::cout << std::endl;

    return 0;
}

In the example above, we first created a vector container and initialized some integer elements. We then used iterators to iterate through the elements of the container and print out the value of each element.

In addition to vectors, the C++ standard library also includes various other containers such as lists, deques, sets, and maps, each with their own unique characteristics and uses. Likewise, each container has its corresponding iterator for accessing and iterating through the elements within.

In actual development, we can choose the appropriate containers and iterators based on specific requirements to store and operate data. At the same time, we can customize containers and iterators to create custom data structures and algorithms.