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

最新推荐文章于 2022-02-04 00:31:49 发布

deji2217

最新推荐文章于 2022-02-04 00:31:49 发布

阅读量234

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/Chicago/p/9927765.html

本文通过C++代码示例，介绍了动态数组、栈、队列及优先队列的使用方法，包括随机数生成、元素的添加与移除、排序等操作，展示了不同数据结构的特点与应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

动态数组
栈
队列
优先队列

动态数组

    srand(time(0));
    std::vector<int> 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<int> 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<int> 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<int> 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<int,std::vector<int>,std::greater<int> > 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