题目:
输入一个数字n,将1~n数字入栈,给出一个序列判断是否符合出栈的次序,如果符合输出Yes,否则输出No。
样例:
5
5 4 1 2 3
No
5
5 4 3 2 1
Yes
import java.util.Scanner;
import java.util.Stack;
public class 出栈序列的合法性 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Stack<Integer> st = new Stack<Integer>();
int[] arry = new int[n + 1];
for (int i = 1; i <= n; i++) {
arry[i] = sc.nextInt();
}
int A = 1, B = 1;
int flag = 1;
while (B <= n) {
if (arry[B] == A) {
A++;
B++;
} else if (!st.empty() && st.peek() == arry[B]) {
st.pop();
B++;
} else if (A <= n) {
st.push(A++);
} else {
flag = 0;
break;
}
}
if (flag == 0)
System.out.println("No");
else
System.out.println("Yes");
}
}