stl总结精简版

STL 精简版

vetor

#include<vector>
#include<cstdio>
#include<algorithm>
#include<iostream> 
using namespace std;
int main()
{
    vector <int> a;//定义一维数组
    vector <int *> tm; //定义二位数组
    int b = 5;
    a.push_back(b);//在数组的最后添加一个数据
    a.push_back(1);
    a.push_back(2);
    a.pop_back();//去掉数组的最后一个数据
    cout<<a.at(1)<<endl;//得到编号位置的数据 
    vector<int>::iterator it;
    for(it = a.begin(); it != a.end(); it++){
        printf("%d ",*it);
    }
    puts("");
    printf("front = %d; back = %d
",a.front(),a.back());
    it = a.begin();
    a.erase(it);//删除指针数据项
    for(int i = 0; i < a.size(); i++){
        printf("%d ",a[i]);
    }
    puts("");
    a.clear();//清空 
    if(a.empty()) puts("now its over");
    return 0;
}

 set

#include<set>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct Node{
    char str[100];
    bool operator < (const Node a) const {
        return (strcmp(str,a.str) <= 0);
    }
};
int main()
{
    set<int>s;
    s.insert(1);
    s.insert(2);
    s.insert(3);
    //set中不会有重复的元素，所以我们如果需要去重，直接丢到set里是不错的选择
    //set可以定义比较函数，因为set可以通过中序遍历直接从小到大的排序输出
    
    //中序遍历
    set<int>::iterator it;
    for(it = s.begin(); it != s.end(); it++){
        printf("%d ",*it);
    } 
    puts("");
    s.erase(2);//删除键值为2的元素
    printf("find(3) = %d
",s.find(3));
    for(it = s.begin(); it != s.end(); it++){
        printf("%d ",*it);
    } 
    puts("");
    s.clear();//清空set 
    if(s.empty()) puts("Now its over");
    
    set<Node> n;
    Node tm;
    tm.str[0] = 's'; tm.str[1] = 'o';tm.str[2] = 0;
    n.insert(tm);
    Node tm2;
    tm2.str[0] = 'g'; tm2.str[1] = 'e';tm2.str[2] = 0;
    printf("%d
", (tm < tm2));
    printf("%d
", (strcmp("ge", "so")));
    tm.str[0] = 'g'; tm.str[1] = 'e';tm.str[2] = 0;
    n.insert(tm);
    tm.str[0] = 's'; tm.str[1] = 'i';tm.str[2] = 0;
    n.insert(tm);
    tm.str[0] = 'b'; tm.str[1] = 'e';tm.str[2] = 0;
    n.insert(tm);
    tm.str[0] = 'd'; tm.str[1] = 'n';tm.str[2] = 0;
    n.insert(tm);
    set<Node>::iterator p;
    for(p = n.begin(); p!=n.end(); p++ ){
        printf("%s ",(*p).str);
    }
     puts("");
    return 0;
}

 stack

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;

int main()
{
    stack<int> st;
    st.push(1);
    st.push(2);
    st.push(3);
    while(!st.empty()){
        printf("%d ", st.top());
        st.pop();
    }
    puts("");
    printf("size = %d
",st.size());
    return 0;
}

 queue

#include<cstdio>
#include<queue>
using namespace std;
int main()
{
    queue<int> qu;
    for(int i = 0; i < 5; i++){
        qu.push(i);
    }
    printf("front = %d; back = %d
",qu.front(), qu.back());
    while(!qu.empty()){
        printf("%d ",qu.front());
        qu.pop();
    }
    puts("");
    printf("size = %d
",qu.size());
    return 0;
}

 priority_queue

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int main()
{
    priority_queue<int> q;
    for(int i = 0;i < 9; i++) q.push(i);
    while(!q.empty()){
        printf("%d ",q.top());
        q.pop();
    }
    puts("");
    return 0;
}