Advertisement
Shuva_Dev

Everything about vector

Dec 16th, 2022
545
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.76 KB | None | 0 0
  1.  
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. int main ()
  5. {
  6.     vector<int> v;
  7.  
  8.     v.push_back( 1 );
  9.     v.push_back( 2 );
  10.     v.push_back( 3 );
  11.  
  12.     cout << v[0] << " " << v[1] << " " << v[2] << endl; /// 1 2 3
  13.  
  14.     v[1] = 3;
  15.     cout << v[0] << " " << v[1] << " " << v[2] << endl; /// 1 3 3
  16.  
  17.     cout << v.size() << endl; /// 3
  18.     for ( int i = 0; i < v.size(); i++ ) cout << v[i] << " "; /// 1 3 3
  19.     cout << endl;
  20.  
  21.     vector <int> v1 = { 2, 3, 4 };
  22.  
  23.     cout << v1.size() << endl; /// 3
  24.     for ( int i = 0; i < v1.size(); i++ ) cout << v1[i] << " "; /// 2 3 4
  25.     cout << endl;
  26.  
  27.     v.clear();
  28.     cout << v.size() << endl; /// 0
  29.     cout << v.empty() << endl; /// 1
  30.     cout << v1.empty() << endl; /// 0
  31.  
  32.     v1.resize(5);
  33.     cout << v1.size() << endl; /// 5
  34.     for ( int i = 0; i < v1.size(); i++ ) cout << v1[i] << " "; /// 2 3 4 0 0
  35.     cout << endl;
  36.  
  37.     vector<int> a(5);
  38.  
  39.     cout << a.size() << endl; /// 5
  40.     for ( int i = 0; i < a.size(); i++ ) cout << a[i] << " "; /// 0 0 0 0 0
  41.     cout << endl;
  42.  
  43.     a = v1;
  44.  
  45.     for ( auto u : a ) cout << u << " "; /// 2 3 4 0 0
  46.     cout << endl;
  47.  
  48.     vector<int>::iterator it;
  49.     for ( it = a.begin(); it != a.end(); it++ ) cout << *it << " "; /// 2 3 4 0 0
  50.     cout << endl;
  51.  
  52.     a = { 3, 4, 5, 1, 2 };
  53.  
  54.     sort ( a.begin(), a.end() ); ///O(n*log2(n))
  55.  
  56.     for ( auto u : a ) cout << u << " "; /// 1 2 3 4 5
  57.     cout << endl;
  58.  
  59.     sort ( a.rbegin(), a.rend() );
  60.  
  61.     for ( auto u : a ) cout << u << " "; /// 5 4 3 2 1
  62.     cout << endl;
  63.  
  64.  
  65.     a = { 3, 4, 5, 1, 2 };
  66.     sort ( a.begin(), a.end(), greater<int>() );
  67.  
  68.     for ( auto u : a ) cout << u << " "; /// 5 4 3 2 1
  69.     cout << endl;
  70.  
  71.     a = { 3, 4, 5, 1, 2 };
  72.  
  73.     reverse( a.begin(), a.end() );
  74.  
  75.     for ( auto u : a ) cout << u << " "; /// 2 1 5 4 3
  76.     cout << endl;
  77.  
  78.     cout << a.back() << endl; /// 3
  79.     a.pop_back(); /// O(1) complexity.
  80.     cout << a.back() << endl; /// 4
  81.  
  82.  
  83.     a = { 3, 4, 5, 1, 2 };
  84.     cout << *a.begin() << endl; /// 3
  85.  
  86.     a.erase( a.begin() ); /// O(n) complexity.
  87.     for ( auto u : a ) cout << u << " "; /// 4 5 1 2
  88.     cout << endl;
  89.  
  90.     a.erase( a.begin()+2 );
  91.     for ( auto u : a ) cout << u << " "; /// 4 5 2
  92.     cout << endl;
  93.  
  94.     a = { 1, 1, 2, 2, 2, 3, 3 };
  95.     unique( a.begin(), a.end() );
  96.  
  97.     for ( auto u : a ) cout << u << " "; /// 1 2 3 2 2 3 3
  98.     cout << endl;
  99.  
  100.  
  101.     a = { 1, 1, 2, 2, 2, 3, 3 };
  102.     int n = unique( a.begin(), a.end() ) - a.begin();
  103.  
  104.     cout << n << endl; /// 3
  105.     for ( int i = 0; i < n; i++ ) cout << a[i] << " "; /// 1 2 3
  106.     cout << endl;
  107.  
  108.     a = { 2, 3, 1, 5 };
  109.     cout << max_element( a.begin(), a.end() ) - a.begin() << endl; /// 3
  110.     cout << *max_element( a.begin(), a.end() ) << endl; /// 5
  111.  
  112.     return 0;
  113. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement