算法笔记-2、STL容器的学习使用.zip

#include <cstdio> #include <queue> int main() { std::queue<int> q; for (int i = 1; i <= 5; ++i) q.push(i);//入队 printf("队头 = %d 队尾 = %d q.size() = %d\n", q.front(), q.back(), q.size()); //队列---限制插入删除位置--迭代器iterator无用 erase insert插入删除无用 //front(), back()//队头和队尾 //pop()队头元素出队 push()队尾入队 // for (int i = 1; i <= 3; ++i) // q.pop(); // printf("队头 = %d 队尾 = %d q.size() = %d\n", q.front(), q.back(), q.size()); //检查队列是否为空?empty() if (q.empty() == true) printf("Empty\n"); else printf("Not Empty\n"); q.pop(); printf("出队1次后 队头 = %d 队尾 = %d q.size() = %d\n", q.front(), q.back(), q.size()); if (q.empty() == true) printf("Empty\n"); else printf("Not Empty\n"); q.pop(); printf("出队2次后 队头 = %d 队尾 = %d q.size() = %d\n", q.front(), q.back(), q.size()); for (int i = 1; i <= 3; ++i) q.pop(); if (q.empty() == true) printf("Empty\n"); else printf("Not Empty\n"); printf("连续出队3次后 队头 = %d 队尾 = %d q.size() = %d\n", q.front(), q.back(), q.size()); return 0; }