#include <iostream>
#include <vector>
int main()
{
// Create a vector containing integers
std::vector<int> v = { 7, 5, 16, 8 };
// Add two more integers to vector
v.push_back(25);
v.push_back(13);
// Print out the vector
std::cout << "v = { ";
for (int n : v) {
std::cout << n << ", ";
}
std::cout << "};
";
}
#include <iostream>
#include <vector>
using namespace std;
int main()
{
// Create a vector containing integers
vector<int> v = { 7, 5, 16, 8 };
v.push_back(25); // Adds 25 to the contents of the vector
v.push_back(13); // Adds 13 to the contents of the vector
// Print out the contents of the vector
cout << "v = { ";
for (int n : v) {
std::cout << n << ", ";
}
cout << "};
";
}
// REMEMBER TO REPLACE '???' with the storage type
// needed
#include <vector>
// optional
#include <bits/stdc++.h>
#include <algorithm>
// ===== BASIC USAGE
// constructor
std::vector<???> v;
// access
v[4]; // : ???
v[4] = <???>;
// ===== CHECKS
// size
v.size() // : size_type (int?)
// check size zero
v.empty() // : bool
// ===== INSERT
// 'push' (add an element at the end)
v.push_back(<???>);
// 'pop' (delete last item)
v.pop() // : void
// insert at a given position
v.insert(v.begin() + 3, <???>);
// CONSTRUCT AND INSERT
v.emplace(v.begin() + 3, <???>);
// ===== QUERY
// find something in the array
// https://m.cplusplus.com/reference/algorithm/find/
auto it = std::find(v.begin(), v.end(), <???>);
// returns v.end() if the element has not been found
// ===== DELETE
// delete everything from the vector
v.clear();
// delete given the cell number (from zero)
v.erase(v.begin( ) + 5);
// ===== SORT
// array sort
std::sort(v.begin(), v.end());
// ==== OTHERS
// iterate
for(auto x : v) {}
#include <vector>
#include <string>
int main() {
std::vector<std::string> str_v;
str_v.push_back("abc");
str_v.push_back("hello world!!");
str_v.push_back("i'm a coder.");
for(auto it = str_v.beigin();it != str_v.end(); it++) {
printf("%s
",it->c_str());
}
}
vector <int> vc;
#include <vector>
#include <iostream>
int main ()
{
std::vector<int> v1; // LINE I
v1.push_back(10); // LINE II
std::cout<<v1.front()<<":"<<v1.back()<<std::endl; // LINE III
return 0;
}
//code compiles successfully
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> v1 ={1,2,3,4,5};
vector<int> v2{1,2,3,4};
vector<int> v3(4,11);
cout << "vector1" <<" ";
for(int i:v1){
cout << i << " ";
}
for(int i:v1){
cout << i << " ";
}
for(int i:v1){
cout << i << " ";
}
}
vector<int> v1;
v1.push_back(10); // adds 10
v1.pop_back(); // removes 10
Code Example |
---|
Cpp :: reverse function in cpp string |
Cpp :: c++ remove text file |
Cpp :: debugging c/c++ with visual studio code |
Cpp :: c++ loop vector |
Cpp :: c++ string to char array |
Cpp :: lambda c++ |
Cpp :: 2d array c++ |
Cpp :: c++ public class syntax |
Cpp :: back() in c++ |
Cpp :: how to use cout function in c++ |
Cpp :: sort a vector c++ |
Cpp :: team fortress |
Cpp :: long to string cpp |
Cpp :: sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument] |
Cpp :: anagram solution in c++ |
Cpp :: c++ input |
Cpp :: array to string c++ |
Cpp :: remove element from vector |
Cpp :: c++ capture screen as pixel array |
Cpp :: intersection.cpp |
Cpp :: how to slice vector in c++ |
Cpp :: C++ Infinite while loop |
Cpp :: cpp array init value |
Cpp :: cpp map insert |
Cpp :: c++ reverse part of vector |
Cpp :: class operator overloading c++ |
Cpp :: passing custom function in sort cpp |
Cpp :: print in c ++ |
Cpp :: long long int range c++ |
Cpp :: UENUM ue4 |