C++ 的 STL

#include <vector>

vector<int> ans;//int的型的数组
vector<structure> ans;//一个structure结构体的数组
//指定长度的初始化
vector<short> ans(n);
vector<double> ans(n,2);//长度为n,全为2的数组
vector<double> shaow(ans);//拷贝初始化，类型长度需相同
vector<int> a{1, 2, 3, 4, 5};

//二维
vector<int>ans[5];//行为固定的5，列为动态可变
vector<vectot<int> >num;//行列均可以变
vector<vector<int> > a(n + 1, vector<int>(m + 1, 0));//固定n+1行m+1列初始值为0的二维数组

#include <iostream>
#include "vector"
using namespace std;
int main() {
    int n = 5;
    vector<int> num(5, 1);
    cout<<num[2];//访问下标为2的元素
//智能指针遍历
    for (auto i: num)
        cout << i << " ";
//遍历
    for(int i=0;i<num.size();i++)
        cout<<num[i]<<' ';
    return 0;
}

#include <iostream>
#include "vector"
using namespace std;
int main() {
    int n = 5;
    vector<int> num(5, 1);
    for(vector<int>::iterator it=num.begin();it!=num.end();it++)
        cout<<*it<<' ';
    return 0;
}

#include <stack>

stack<int>ans;

#include <iostream>
#include <stack>
using namespace std;
int main() {
    stack<int>a;
    int i;
    while(!a.empty())
    {
        i=a.top();
        cout<<i<<" ";
        a.pop();
    }
    return 0;
}

#include<queue>

queue<int>ans;

#include <iostream>
#include <queue>
using namespace std;
int main() {
    queue<int>a;
    for(int i=0;i<10;i++)
        a.push(i);
    int i;
    while(!a.empty())
    {
        i=a.front();
        cout<<i<<' ';
        a.pop();
    }
    return 0;
}

#include <deque>

deque<int>ans;

#include <iostream>
#include <deque>
#include "algorithm"
using namespace std;
int main() {
deque<int>a;
int b[5]={3,8,9,6,2};
for(int i=0;i<5;i++)
    a.push_front(b[i]);
sort(a.begin(),a.end());
int i;
while(!a.empty())
{
    i=a.back();
    cout<<i<<' ';
    a.pop_back();
}
    return 0;
}

#include<queue>

#include <map>
priority_queue<Type, Container, Functional>

#include<iostream>
#include <queue>
using namespace std;
int main()
{
    priority_queue<int> a;
    priority_queue<int, vector<int>, greater<int> > c;  //这样就是小顶堆
    for (int i = 0; i < 5; i++)
    {
        a.push(i);
        c.push(i);
    }
    while (!a.empty())
    {
        cout << a.top() << ' ';
        a.pop();
    }
    cout << endl;
    while (!c.empty())
    {
        cout << c.top() << ' ';
        c.pop();
    }
    cout << endl;
    return 0;
}

#include<map>

#include<iostream>
#include <map>
using namespace std;
int main()
{
map<int,string>a;
a[1]="hello";
a[2]="hi";
cout<<a[1];
cout<<endl;
    map<int,string>::iterator it;
    for(it=a.begin();it!=a.end();it++)
        cout<<it->first<<':'<<it->second<<endl;
    for(auto i:a)
        cout<<i.first<<":"<<i.second<<endl;
    return 0;
}

#include <set>

#include<iostream>
#include <set>
using namespace std;
int main()
{
    set<int>a;
    a.insert(8);
    a.insert(3);
    a.insert(9);
    a.insert(7);
    a.insert(6);
    a.insert(5);
    for(set<int>::iterator it=a.begin();it!=a.end();it++)
        cout<<*it<<" ";

   return 0;
}
//结果为3 5 6 7 8 9

#include<utility>

#include <string>

string str1; //生成空字符串
string str2("123456789"); //生成"1234456789"的复制品 
string str3("12345", 0, 3);//结果为"123" ，从0位置开始，长度为3
string str4("123456", 5); //结果为"12345" ，长度为5
string str5(5, '2'); //结果为"22222" ,构造5个字符'2'连接而成的字符串
string str6(str2, 2); //结果为"3456789"，截取第三个元素（2对应第三位）到最后

#include <bitset>

bitset < n >a; //a有n位，每位都为0
bitset < n >a(b);
bitset < n >a(s,pos,n);//a是s中从位置pos开始的n个位的副本
bitset < n >a(s);

#include <array>

array<int, 100> a;//声明一个大小为100的int型数组
array<int, 100> a{};//声明一个大小为100的int型数组，初始值均为0
array<int, 100> a{1, 2, 3};//始化部分值，其余全部为0
array<int, 100> a = {1, 2, 3};

array<int, 4> a = {1, 2, 3, 4};
for(int i = 0; i < 4; i++) 
    cout << a[i] << " \n"[i == 3];
//迭代器
for(auto i : a)
    cout << i << " ";
//at访问
array<int, 4> a = {1, 2, 3, 4};
int res = a.at(1) + a.at(2);
cout << res << "\n";

get<1>(a) = x;//将a数组下标为1位置处的值改为x

#include <tuple>

tuple<int, int, string> t1;//声明一个空的tuple三元组
t1 = make_tuple(1, 1, "hahaha");

tuple<int, int, int, int> t2(1, 2, 3, 4);

auto p = make_pair("wang", 1);
tuple<string, int> t3 {p}; //将pair对象赋给tuple对象

int first = get<0>(t);
get<0>(t) = 1;

tuple<int, int, int> t(1, 2, 3);
cout << tuple_size<decltype(t)>::value << "\n"; // 3

int one, three;
string two; 
tuple<int, string, int> t(1, "hahaha", 3);
tie(one, two, three) = t;
cout << one << two << three << "\n"; // 1hahaha3