Description: Determine a sequence (from 1-N, N < = 10) sequence of the legality of the stack, the legitimate sequence of output YES, the illegal export of NO. For example: N = 3, input sequence: 1 2 3 or 1 3 2 or 2 1 3 or 2 3 1 or 3 2 1 are legitimate. Input: 3 1 2 to be illegal.
To Search:
File list (Check if you may need any files):
出栈序列合法性
..............\aaaaa
..............\.....\aaaaa.dsp
..............\.....\aaaaa.dsw
..............\.....\aaaaa.ncb
..............\.....\aaaaa.opt
..............\.....\aaaaa.plg
..............\.....\Debug
..............\.....\.....\aaaaa.exe
..............\.....\.....\aaaaa.ilk
..............\.....\.....\aaaaa.pch
..............\.....\.....\aaaaa.pdb
..............\.....\.....\f.obj
..............\.....\.....\vc60.idb
..............\.....\.....\vc60.pdb
..............\.....\f.cpp
Download