To be used in DP problems:
vector<vector<int>>dp;//global init
dp =vector<vector<int>>(n,vector<int>(m,0));// local init for test cases
where,
n, m = dimensions of matrix
auto M =4;// num of rowsauto N =3;// num of cols in each rowauto default_value =1;// default value of all int elements
std::vector<std::vector<int>>matrix(M, std::vector<int>(N, default_value));
vector<vector<int>>vec( n ,vector<int>(m,0));
where: n is number of ROWS,
m is number of COLUMNS
So result will be( Let n =2, m =3)[[0,0,0],[0,0,0]](2 x 3)
#include<iostream>#include<vector>#include<algorithm>intmain(){
std::vector<int> v ={2,1,3,6,7,9,8};int max =*max_element(v.begin(), v.end());int min =*min_element(v.begin(), v.end());
std::cout << min <<", "<< max << std::endl;// 1, 9return0;}
#include<vector>#include<algorithm>// all the std and main syntax ofcourse.
vector<int> pack ={1,2,3};// To add at the END
pack.push_back(6);// {1,2,3,6}// OR// To add at BEGGINING
pack.insert(pack.begin(),6)// {6,1,2,3,}