vector

#include <bits/stdc++.h>
using namespace std;

int main() {
//    vector<int> v = {1,2,3,4,5,6,7,8,9,10};
    vector<int> v(10,7);
    cout << "pushback:"<< endl;
    cout << v.size() << endl;
    v.push_back(5);
    v.push_back(2);
    v.push_back(3);
    cout << v.size() << endl;

    // 原始顺序
    cout << "原始顺序:"<< endl;
    for(int i = 0; i < v.size(); i++){
        cout << v[i] <<  ' ';
    }
    cout << endl;
    // 排序
    cout << "排序:"<< endl;
   // sort(v.begin(), v.end());

    for(int i = 0; i < v.size(); i++){
        cout << v[i] <<  ' ';
    }
    cout << endl;

    // 找最大值
    cout << "找最大值:"<< endl;
    auto iter = max_element(v.begin(), v.end());
    cout << *iter << endl;
    int pos = iter - v.begin();
    cout << pos << endl;

    // 找最小值
    cout << "找最小值:"<< endl;
    iter = min_element(v.begin(), v.end());
    cout << *iter << endl;
    pos = iter - v.begin();
    cout << pos << endl;

//    1 2 3 4 5 6 7 8 9 10

    fill(v.begin(), v.end(), 5);
    for(int i = 0; i < v.size(); i++){
        cout << v[i] <<  ' ';
    }
    
    return 0;
}

queue

#include <bits/stdc++.h>

using namespace std;

int main() {
    queue<int> q;

    q.push(1);
    q.push(2);
    q.push(3);

    cout << q.front() << endl;
    cout << q.back() << endl;

    cout << q.size() << endl;
    // 出队列
    q.pop();

    cout << q.front() << endl;
    cout << q.back() << endl;
    cout << q.size() << endl;
    return 0;
}

deque

#include <bits/stdc++.h>

using namespace std;

int main() {
    deque<int> dq;

    dq.push_back(1);
    dq.push_back(2);
    dq.push_front(3);


    for (int i = 0; i < dq.size(); i++) {
        cout << dq[i] << " ";
    }

    cout << endl;


    sort(dq.begin(), dq.end());
    for (int i = 0; i < dq.size(); i++) {
        cout << dq[i] << " ";
    }
    cout << endl;

    dq.pop_front();
    cout << dq.front() << endl;
    dq.pop_back();
    cout << dq.back() << endl;

    dq.pop_back();

    if(!dq.empty()){
        cout << dq.back() << endl;
    }


    return 0;
}