02-线性结构4 Pop Sequence（python3）

最新推荐文章于 2020-06-30 16:30:45 发布

cindy_yao

最新推荐文章于 2020-06-30 16:30:45 发布

阅读量458

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/cindy_yao/article/details/89570009

该博客讨论了如何在给定最大容量M的栈中，根据输入的N个数字顺序进行推入和随机弹出操作，并判断给定的弹出序列是否可能。内容包括输入输出规格说明、示例以及解决方案，强调使用Python的list的append和pop功能解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.