28 vectors
- dynamic size, like list
- std::vector items = {1, 2, 3}
- items.push_back(100)
- reallocate memory if not enough to store
- items.size()
- items[items.size() - 1]
#include <iostream>
#include<vector>
int main()
{
std::vector<int> data = {1, 2, 4};
data.push_back(12); \\ append
std::cout << data[3] << std::endl; \\ like array
return 0;
}
// push and pop
#include <iostream>
#include<vector>
int main()
{
std::vector<int> data = {1, 2, 4};
data.push_back(12);
std::cout << data[data.size() - 1] << std::endl;
data.pop_back();
std::cout << data.size() << std::endl; // 3
return 0;
}
// data: passing by value, &data: passing by reference
#include <iostream>
#include<vector>
void print_vector(std::vector<int> &data) // data: passing by value, &data: passing by reference
{
data.push_back(12);
for(int i = 0; i < data.size(); i++)
{
std::cout << data[i] << "\t";
}
std::cout << "\n";
}
int main()
{
std::vector<int> data = {1, 2, 4};
print_vector(data);
print_vector(data);
print_vector(data);
return 0;
}