![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PTA#数据结构
文章平均质量分 84
-believe-
小菜鸟一只,努力学习ing
展开
-
【PTA】01-复杂度2 Maximum Subsequence Sum
01-复杂度2 Maximum Subsequence Sum (25 分)Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maxi...原创 2018-09-23 18:14:19 · 277 阅读 · 0 评论 -
02-线性结构4 Pop Sequence (25 分)
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 ...原创 2018-11-17 10:57:53 · 840 阅读 · 0 评论