本题考查
栈
算法思路
总体思路:根据出栈序列,入栈,直到其当前栈顶元素等于出栈元素;如果所有元素均入栈后,都无法使得当前栈顶元素与出栈元素相同,停止
压栈顺序:1,2,3,4,5,6,7
输出顺序:1,7,6,5,4,3,2
当栈为空时,压栈。比较栈顶元素与输出顺序当前指定元素是否相同,相同出栈,若不相同则将下一个元素压栈。
程序结束的标志:
- 输出顺序全部元素都已经遍历到
- 压栈顺序中全部元素遍历完且此时栈顶元素不等于输出顺序当前指定元素
- 栈大小等于给定容量且此时栈顶元素不等于输出顺序当前指定元素
AC代码
import java.util.Scanner;
import java.util.Stack;
public class Main {
public static void main(String[] args) {
Scanner scaner = new Scanner(System.in);
int capacity = scaner.nextInt();
int num = scaner.nextInt();
int round = scaner.nextInt();
scaner.nextLine();
Stack<Integer> stack = new Stack<Integer>();
for(int i = 0 ; i < round ; i++) {
stack.clear();
int currentPush = 2;
String[] str = scaner.nextLine().split(" ");
int point = 0; //用作输出顺序的元素指针
stack.push(1);
while(true) {
int temp = Integer.parseInt(str[point]);
if(stack.isEmpty()) {
stack.push(currentPush);
currentPush++;
}
if(!stack.isEmpty()&&stack.peek() == temp) {
stack.pop();
point++;
if(point == num) //结束条件1
break;
continue;
}
if(!stack.isEmpty()&&stack.peek() != temp&&stack.size() < capacity) {
stack.push(currentPush);
currentPush++;
}
if((!stack.isEmpty()&&stack.peek() != temp && currentPush > num )|| (point == num)||(stack.size() == capacity&&stack.peek() != temp))
//结束条件2、3
break;
}
if(!stack.isEmpty())
System.out.println("NO");
else
System.out.println("YES");
}
scaner.close();
}
}