// Create a vector containing n
//vectors of size m, all u=initialized with 0
vector<vector<int> > vec( n , vector<int> (m, 0));
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
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, 9
return 0;
}
// CPP program
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n = 4;
int m = 5;
/*
Create a vector containing "n"
vectors each of size "m".
*/
vector<vector<int>> vec( n , vector<int> (m));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
vec[i][j] = j + i + 1;
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cout << vec[i][j] << " ";
}
cout << endl;
}
return 0;
}
vector< vector<int>> a(rows, vector<int> (cols));
#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,}
// CPP program
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n = 3;
int m = 4;
/*
We create a 2D vector containing "n"
elements each having the value "vector<int> (m, 0)".
"vector<int> (m, 0)" means a vector having "m"
elements each of value "0".
Here these elements are vectors.
*/
vector<vector<int>> vec( n , vector<int> (m, 0));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cout << vec[i][j] << " ";
}
cout<< endl;
}
return 0;
}
#include<vector>
#include<algorithm> //**********Have to include THIS...OTHERWISE
sort( vectorName.begin(),vectorName.end() ) ;
// CPP program
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n = 3;
int m = 4;
/*
We create a 2D vector containing "n"
elements each having the value "vector<int> (m, 0)".
"vector<int> (m, 0)" means a vector having "m"
elements each of value "0".
Here these elements are vectors.
*/
vector<vector<int>> vec( n , vector<int> (m, 0));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cout << vec[i][j] << " ";
}
cout<< endl;
}
return 0;
}
// CPP program
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n = 3;
int m = 4;
/*
We create a 2D vector containing "n"
elements each having the value "vector<int> (m, 0)".
"vector<int> (m, 0)" means a vector having "m"
elements each of value "0".
Here these elements are vectors.
*/
vector<vector<int>> vec( n , vector<int> (m, 0));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cout << vec[i][j] << " ";
}
cout<< endl;
}
return 0;
}
vector<vector<int>> vec(N, vector<int> (M, INT_MAX));
Explanation::
vector<vector<int>> -- will take the formed container
N -- Think like row of 2d Matrix
vector<int> (M, INT_MAX) -- In each row, there is again a vector associated with it,
that will formed 2d array.
Code Example |
---|
Cpp :: vector of vectors of pairs c++ |
Cpp :: c++ get pointer from unique_ptr |
Cpp :: cpp #include "" < |
Cpp :: vectors c++ |
Cpp :: cpp template |
Cpp :: c++ average vector |
Cpp :: c++ how to return an empty vector |
Cpp :: enum c++ |
Cpp :: unpack tuple c++ |
Cpp :: lambda function in c++ |
Cpp :: variables in c++ |
Cpp :: looping in map c++ |
Cpp :: stack class implementation to file unix-style in c++ |
Cpp :: print hola mundo |
Cpp :: how to make a vector in c++ |
Cpp :: use of strstr in c++ |
Cpp :: vector<intv[] |
Cpp :: copy constructor c++ syntax |
Cpp :: c++ set intersection |
Cpp :: how to pass an array by reference in c++ |
Cpp :: declare a tab c++ |
Cpp :: max heap insertion c++ |
Cpp :: c++ define array with values |
Cpp :: how to use power in c++ |
Cpp :: for_each c++ |
Cpp :: hashset in cpp |
Cpp :: raspberry pi mount external hard drive |
Cpp :: C++ Syntax for Passing Arrays as Function Parameters |
Cpp :: C/C++ loop for |
Cpp :: pointer to value of others file cpp |