1.初始化:
Stack<T> sk=new Stack<>();
2.常用方法:
pop()出栈;
push(Object)入栈;
size()栈尺寸;
search(Object)寻找Object在栈中的位置(从顶向下数,从1开始计数);
empty()是否栈空;
peek()返回栈顶元素;
3.实例:
package lanqiaobei;
import java.util.Scanner;
import java.util.Stack;
public class Main59 {
public static void main(String[] args) {
Stack<Integer> sk=new Stack<>();
int n;
Scanner in=new Scanner(System.in);
int num;
n=in.nextInt();
for(int i=0;i<n;i++) {
num=in.nextInt();
sk.push(num);
}
System.out.println("sk_size: "+sk.size());
System.out.println("search_value_index(1): "+sk.search(1));
while(sk.empty()==false) {
System.out.println(sk.peek());
sk.pop();
}
in.close();
}
}
输入:
5
1 4 7 8 9
输出:
sk_size: 5
search_value_index(1): 5
9
8
7
4
1