摘要
针对判断某一序列是否为合法出栈序列的问题,提出了一种基于降序段的时间复杂度为O(n2)的新算法.该算法简单易懂并且比传统判断方法具有更高的效率.
The character of out-stack sequence is analyzed and researched.A new algorithm is proposed for estimating a sequence whether is a rational out-stack sequence.The algorithm is a new method based on the descending segment and its time complexity is O（n2）.The algorithm is simple and easy to understand and more higher efficiency than the traditional method to finding all of the out-stack sequence.
出处
《江西师范大学学报（自然科学版）》
CAS
北大核心
2011年第3期251-253,共3页
Journal of Jiangxi Normal University(Natural Science Edition)
基金
江西省教育厅科技项目(GJJ11383)
江西省教改课题(JXJG-10-2-17)
江西师范大学青年成长基金(2701)资助项目
关键词
栈
出栈序列
降序段
stack
out-stack sequence
descending segment
