(2016秋数据结构课后练习题总结)02-线性结构4 Pop Sequence (25分)

最新推荐文章于 2018-09-09 13:56:01 发布

时间杀手Time

最新推荐文章于 2018-09-09 13:56:01 发布

阅读量1.2k

点赞数 1

分类专栏：数据结构文章标签：数据结构 pop 结构堆栈

本文链接：https://blog.csdn.net/jiaomenglei/article/details/52497088

版权

数据结构专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Given a stack which can keep $M$ numbers at most. Push $N$ numbers in the order of 1, 2, 3, ..., $N$ and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if $M$ is 5 and $N$ is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.

Input Specification:

Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): $M$ (the maximum capacity of the stack), $N$ (the length of push sequence), and $K$ (the number of pop sequences to be checked). Then $K$ lines follow, each contains a pop sequence of $N$ numbers. All the numbers in a line are separated by a space.

Output Specification:

For each pop sequence, print in one line "YES" if it is indeed a possible pop sequence of the stack, or "NO" if not.

Sample Input:

5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2

Sample Output:

YES
NO
NO
YES
NO

此题考查堆栈的用法，一堆数按照1，2，3，4....N的顺序入栈，如果第M个数要出栈，则前面一定有M-1个数入栈。
import java.util.Scanner;
import java.util.Stack;

public class Main {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		Stack<Integer> stack = new Stack<Integer>();
		int M = scan.nextInt();
		int N = scan.nextInt();
		int K = scan.nextInt();
		int num = 0;
		while (K-- != 0) {
			stack.clear();
			boolean flag = true;
			int T = 1;
			for (int j = 0; j < N; j++) {
				num = scan.nextInt();
				if (flag) {
					while (stack.isEmpty() || stack.lastElement() != num) {
						stack.push(T);
						if (stack.size() > M) {
							flag = false;
							break;
						}
						T++;
					}
					if (flag && stack.size() >= 1 && stack.lastElement() == num) {
						stack.pop();
					}
				}
			}
			if (flag) {
				System.out.println("YES");
			} else {
				System.out.println("NO");
			}
		}
	}
}