NOIP2018考前抱佛脚——数据结构基础及STL实现

动态数组

    srand(time(0));
    std::vector qwq;
    
    for(int i = 1;i <= 10;++i)
        qwq.push_back(rand()%100);
    
    int n = qwq.size();
    
    for(int i = 1;i <= n;++i)
        std::cout<< qwq[i-1] << " "; 

    std::cout << "\n";
    
    sort(qwq.begin(),qwq.end());
    
    for(int i = 1;i <= n;++i)
        std::cout<< qwq[i-1] << " "; 

栈

    srand(time(0));
    std::stack qwq;
    
    for(int i = 1;i <= 10;++i)
    {
        int x = rand()%100;
        std::cout << x << " ";
        qwq.push(x);
    }
    
    std::cout << "\n";
    int n = qwq.size();
    
    for(int i = 1;i <= n;++i)
    {
        std:: cout << qwq.top() <<" ";
        qwq.pop();
    }

队列

    srand(time(0));
    std::queue qwq;
    
    for(int i = 1;i <= 10;++i)
        qwq.push(rand()%100);

    int n = qwq.size();
    
    for(int i = 1;i <= n;++i)
    {
        std::cout << qwq.front() << " ";
        qwq.pop();
    }
    
    if(qwq.empty()) std::cout << "\n队列已经清空！";

优先队列

//1. 大根堆
    srand(time(0));
    std::priority_queue qwq;
    
    for(int i = 1;i <= 10;++i)
        qwq.push(rand()%100);
    
    int n = qwq.size();
    
    for(int i = 1;i <= n;++i)
    {
        std::cout << qwq.top() << " ";
        qwq.pop();
    }
    
    std::cout << std::endl; 
//2. 小根堆
    std::priority_queue,std::greater > qaq;
    
    for(int i = 1;i <= 10;++i)
        qaq.push(rand()%100);
    
    n = qaq.size();
    
    for(int i = 1;i <= n;++i)
    {
        std::cout << qaq.top() << " ";
        qaq.pop();
    }

转载于:https://www.cnblogs.com/Chicago/p/9927765.html