CPP

c++ vectors

#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 << "}; 
";
}

Vector in c++

// Create an empty vector
vector<int> vect;

// Create a vector of size n with all values as 10.
vector<int> vect(n, 10);

//initilize with values
vector<int> vect{ 10, 20, 30 };

//initilize with old array
vector<int> vect(arr, arr + n);

//initilize with old vector
vector<int> vect2(vect1.begin(), vect1.end());

vectors c++

#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 << "}; 
";
}

c++ vector

// 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) {}

c++ vector

#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());
  }
}

vectors in c++

vector <int> vc;

c++ vector

#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

vectors in c++

#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 << " "; 
  }
}

cpp vector

vector<int> v1;
v1.push_back(10); // adds 10
v1.pop_back(); // removes 10

vector of vectors c++

vector<vector<int>> matrix(x, vector<int>(y));

This creates x vectors of size y, filled with 0's.