queue
queue 隊(duì)，一種先進(jìn)先出的數(shù)據(jù)結(jié)構(gòu)，c++ stl里也叫容器適配器，它是以deque 或list為基礎(chǔ)的一種數(shù)據(jù)結(jié)構(gòu)(不能用vector)queue的相關(guān)操作
queue<int deque<int>> q;queue<int list<int>> q;q.empty();q.size();q.push(item); //入隊(duì)q.pop(); //出隊(duì)q.back(); //返回對(duì)尾元素q.front(); //返回隊(duì)首元素學(xué)習(xí)代碼
#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;//默認(rèn)以deque為基礎(chǔ) c.push(10); c.push(5); c.push(-1); c.push(20); cout << "隊(duì)列里數(shù)據(jù)有" << c.size() << "個(gè)" << endl; cout << "隊(duì)首:" << c.front() << endl; cout << "隊(duì)尾:" << c.back() << endl; c.pop(); cout << "新隊(duì)首:" << c.front() << endl; while (c.size() != 0) { cout << "刪除" << c.front() << endl; c.pop(); } if (c.empty()) { cout << "現(xiàn)在隊(duì)列為空" << endl; } getchar(); return 0;}新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
