传说中的数据结构(Java)

import java.util.*;
public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a[] = new int[1100];
		int num,t;
		String str;
		while(in.hasNext()) {
			num = -1;
			t = in.nextInt();
			while(t-->0) {
				str = in.next();
				if(str.compareTo("push") == 0) {
					a[++num] = in.nextInt();
				}
				else if(str.compareTo("pop") == 0) {
					if(num == -1)
						System.out.println("error");
					else
						num--;
				}
				else if(str.compareTo("top") == 0) {
					if(num == -1)
						System.out.println("empty");
					else
						System.out.println(a[num]);
				}
			}
			System.out.println();
		}
		in.close();
	}
}

next()不会吸取字符前/后的空格/Tab键，只吸取字符，开始吸取字符（字符前后不算）直到遇到空格/Tab键/回车截止吸取；

nextLine()吸取字符前后的空格/Tab键，回车键截止。