算法_stack_queue

栈，stack

S.top(): 取出栈顶
S.empty(): 判断栈是否为空
S.push(x): 将x添加至栈
S.pop(): 弹出栈顶
S. size(): 栈的存储元素个数

#include<stack>
#include<stdio.h>
int main()
{
 std::stack<int> S;
 if (S.empty()) {
  printf("S is empty!\n");
 }
 S.push(5);
 S.push(6);
 S.push(10);
 printf("S.top = %d\n", S.top());
 printf("S.size = %d\n", S.size());
 return 0;
}

运行结果为：

S is empty!
S.top = 10
S.size = 3

队列，queue

Q.empty(): 判断队列是否为空
Q.front(): 返回队列头部元素
Q.back(): 返回队列尾部元素
Q.pop(): 弹出队列头部元素
Q.push(x): 将x添加至队列
Q.size(): 返回队列的存储元素的个数

#include<stdio.h>
#include<queue>
int main()
{
 std::queue<int> Q;
 if (Q.empty())
 {
  printf("Q is empty!\n");
 }
 Q.push(5);
 Q.push(6);
 Q.push(10);
 printf("Q.front = %d\n", Q.front());
 Q.pop();
 Q.pop();
 printf("Q.front =%d\n", Q.front());
 Q.push(1);
 printf("Q.back=%d\n", Q.back());
 printf("Q.size = %d\n", Q.size());
 return 0;
}

运行结果为：
Q is empty!
Q.front = 5
Q.front =10
Q.back=1
Q.size = 2