若一个栈以向量v[1..n]存储,且空栈的栈顶指针top为n+1,则将元素x入栈的正确操作是A.top = top+1; V[top] = x; \x05\x05B.V[top] = x; top = top+1; C.top = top-1; V[top] = x; \x05\x05D.V[top] = x; top = top-1;为什么不是A啊?T

若一个栈以向量v[1..n]存储,且空栈的栈顶指针top为n+1,则将元素x入栈的正确操作是A.top = top+1; V[top] = x; \x05\x05B.V[top] = x; top = top+1; C.top = top-1; V[top] = x; \x05\x05D.V[top] = x; top = top-1;为什么不是A啊?T
若一个栈以向量v[1..n]存储,且空栈的栈顶指针top为n+1,则将元素x入栈的正确操作是
A.top = top+1; V[top] = x; \x05\x05B.V[top] = x; top = top+1;
C.top = top-1; V[top] = x; \x05\x05D.V[top] = x; top = top-1;
为什么不是A啊?TOP不是应该往上吗?

若一个栈以向量v[1..n]存储,且空栈的栈顶指针top为n+1,则将元素x入栈的正确操作是A.top = top+1; V[top] = x; \x05\x05B.V[top] = x; top = top+1; C.top = top-1; V[top] = x; \x05\x05D.V[top] = x; top = top-1;为什么不是A啊?T
C 啊,现在空栈是指针在最大下标以上,自然是进栈就需要往下减,并且合法下标只是1..n