棧的C++實現（數組）——創建-push-pop-top-清空棧-處理棧

今天學習了利用數組方式的棧的C++實現，這種方式跟指針實現有很多不一樣的地方：

棧的指針實現，棧的創建申請頭結點，push需要申請新的結點，pop釋放結點，這些結點都放在第一個位置，top時，S->next->data即可。

棧的數組實現，只申請一個結點，該結點的結構體內包含，數組的最大容量、棧頂元素下標、指向整形數組的指針（用於存放和刪除新的元素）。

S->topOfStack == -1,空棧；

S->topOfStack == S->capacity - 1,滿棧；

1、聲明結點

    struct Node
    {
        int capacity;    //數組的最大容量
        int topOfStack;  //棧頂下標為-1表示空棧，每次添加新的元素，棧頂元素下標加1
        int *Array;         //指向整形數組的指針
    };
    typedef struct Node stack;

2、空棧，滿棧判斷

int stackArray::isEmpty(stack *S)
{
    return S->topOfStack == emptyTOS;
}
int stackArray::isFull(stack *S)
{
    return S->topOfStack == S->capacity - 1;
}

3、創建棧

stackArray::stack *stackArray::createStack(int maxElements)
{
    if (maxElements < minStackSize)
        cout << "the space of stack is too short,please increase value of maxElements!" << endl;

    stack *S;
    S = (stack*)new(stack);
    if (S == NULL)
        cout << "Out of space! " << '\n';

    S->Array = new int[maxElements];
    if (S->Array == NULL)
        cout << "Out of space! " << '\n';

    S->topOfStack = emptyTOS;  　　//棧頂下標置-1表示空棧
    S->capacity = maxElements;　　 //數組最大容量賦值
    makeEmpty(S);
    return S;
}

5、push,top,pop

stackArray::stack *stackArray::push(stack *S)
{
    if (isFull(S))
    {
        cout << "stack is full!" << endl;
        return 0;
    }
    int x = 0;
    cout << "Please input the data to push: " << endl;
    scanf_s("%d", &x);
    S->Array[++S->topOfStack] = x;    
    return S;
}
int stackArray::top(stack *S)
{
    if (isEmpty(S))        //非空判斷
    {
        cout << "empty stack! " << endl;
        return -1;
    }
    else
        return S->Array[S->topOfStack];
}
stackArray::stack *stackArray::pop(stack *S)
{
    if (isEmpty(S))        //非空判斷
    {
        cout << "empty stack! " << endl;
        return 0;
    }
    else
    {
        S->topOfStack--;
        return S;
    }
}

6、主函數

int main(int argc, char * argv[])
{
    cout << '\n' << "***************************************" << '\n' << '\n';
    cout << "Welcome to the stackArray world! " << '\n';
    cout << '\n' << "***************************************" << '\n' << '\n';

    int i = 1;
    int j = 0;
    int topElement = 0;
    stackArray *a = new stackArray;
    stackArray::stack *S = NULL;
    //int x = 0;
    while (i)
    {
        cout << '\n' << "***************************************" << '\n';
        cout << " 0 : end the stack " << '\n';
        cout << " 1 : creat a stack " << '\n';
        cout << " 2 : display the top element of stack  " << '\n';
        cout << " 3 : push a node in the stack  " << '\n';
        cout << " 4 : pop a node from the stack  " << '\n';
        cout << "***************************************" << '\n';
        cout << "Please input the function your want with the number above : " << '\n';
        scanf_s("%d", &j);

        switch (j)
        {
        case 1:
            cout << "CreatStack now begin : ";
            S = a->createStack(5);
            break;
        case 2:
            topElement = a->top(S);
            cout << "The top element of stack is : " << topElement;
            break;
        case 3:
            cout << "push now begin : ";
            S = a->push(S);
            break;
        case 4:
            cout << "pop now begin : ";
            S = a->pop(S);
            break;
        default:
            cout << "End the stack. ";
            a->disposeStack(S);
            i = 0;
            break;
        }

    }

    return 0;
}

效果同指針，不再贅述。