判定一个顺序栈（存储空间长度Maxsize）为栈满的条件是______
A: top != -1
B: top == -1
C: top != Maxsize
D: top == Maxsize-1
A: top != -1
B: top == -1
C: top != Maxsize
D: top == Maxsize-1
举一反三
- 判定一个顺序栈（存储空间长度Maxsize）为空的条件是______ A: top != -1 B: top == -1 C: top != Maxsize D: top== Maxsize -1
- 设顺序栈st的栈顶指针top的初始值为-1，栈空间大小为MaxSize，则判定st栈为栈空的条件为()。 A: st. top==-1 B: st. top!==1 C: st. top! =MaxSize D: st. top==MaxSize
- 判定一个顺序栈 st (最多元素为 MaxSize )为空的条件是 ( ) A: st->top != -1 B: st->top == -1 C: st->top != MaxSize D: st->top == MaxSize
- 判定一个顺序栈st(最多元素为MaxSize，低地址为栈底)为空的条件是( )。 A: st->;top != -1 B: st->;top == -1 C: st->;top != MaxSize D: st->;top == MaxSize
- 采用顺序存储的栈 ，若数组容量是 MaxSize，栈初始化时操作是 top=0 , 则判断栈满的语句是 A: top == 0 B: top == -1 C: top == MaxSize - 1 D: top == MaxSize