1.创建栈stack
Stack<Integer> stack = new Stack<>();
2.添加元素
//时间复杂度O(1)
stack.push(1);
stack.push(2);
stack.push(3);
//[1,2,3]
3.获取栈顶元素
//时间复杂度O(1)
//3
stack.peek();
4.删除栈顶元素
//时间复杂度O(1)
//temp = 3
int temp = stack.pop();
5.栈的大小
//时间复杂度O(1)
//size = 2
int size= stack.size();
6.栈是否为空
//时间复杂度O(1)
//statue= false
boolean statue= stack.isEmpty();
7.栈的遍历
- 边删除边遍历
//时间复杂度O(n)
while(!stack.isEmpty()){
int num = stack.pop();
}