pop() 函数有什么问题为什么不能正常工作?

What is wrong with the pop() function why doesn't it work correctly?

class stack{
    int *p, *Cursor;
    int size ;
public:
    stack(int sz) {Cursor = p = new int[size=sz+1];} //consider the stack empty when its size is 1
    ~stack() {delete[] p;} //Cursor and P will be destroyed when the program finishes
    void push(int x) {Cursor+=1; *Cursor=x; size++;}
    int pop() {if(Cursor == p) return -1; int temp = *Cursor; Cursor--; size--; return (temp);}
    bool isEmpty(){return(Cursor == p);}
    bool isFull(){return(Cursor == p+size);}
};

这是我的测试:

stack A(3);
    std::cout<<"Empty: "<<A.isEmpty()<<std::endl;
    std::cout<<"Full: "<<A.isFull()<<std::endl;
    A.push(10);
    A.push(20);
    A.push(30);
    std::cout<<std::endl;
    std::cout<<" 1st pop: "<<A.pop()<<std::endl<<" 2nd pop: " <<A.pop()<<std::endl<<" 3rd pop: " <<A.pop()<<std::endl<<" 4th pop: " <<A.pop()<<std::endl;

我得到的输出是:

1st pop: -1
2nd pop: 10
3rd pop: 20
4th pop: 30

虽然我应该得到这样的东西:

while I should get sth like:

1st pop: 30
2nd pop: 20
3rd pop: 10
4th pop: -1

问题是我哪里出错了?

推荐答案

没有出错，但是如果你把 pops (在你的情况下)从右到左计算，如果你把它们都放进去一个 std::cout 行.一般来说.评估顺序未指定.有关这方面的更多详细信息，请参阅此处.

Nothing did go wrong, but the pops get (in your case) evaluated from right to left if you put them all in one std::cout line. In general. the evaluation order is unspecified. For more detail on this see here.

所以你正确地以插入的相反顺序获取元素，然后 -1 然后将它们反转打印.

So you correctly get the elements in reverse order of insertion and then -1 and then print them reversed.