queue
queue 隊，一種先進先出的數據結構，c++ stl里也叫容器適配器，它是以deque 或list為基礎的一種數據結構(不能用vector)queue的相關操作
queue<int deque<int>> q;queue<int list<int>> q;q.empty();q.size();q.push(item); //入隊q.pop(); //出隊q.back(); //返回對尾元素q.front(); //返回隊首元素學習代碼
#include <iostream>#include <queue>#include <deque>#include <list>using namespace std;int main(){ queue<int, deque<int>> a; queue<int, list<int>> b; queue<int> c;//默認以deque為基礎 c.push(10); c.push(5); c.push(-1); c.push(20); cout << "隊列里數據有" << c.size() << "個" << endl; cout << "隊首:" << c.front() << endl; cout << "隊尾:" << c.back() << endl; c.pop(); cout << "新隊首:" << c.front() << endl; while (c.size() != 0) { cout << "刪除" << c.front() << endl; c.pop(); } if (c.empty()) { cout << "現在隊列為空" << endl; } getchar(); return 0;}新聞熱點
疑難解答
圖片精選
