這一部分的算法和鏈表聯(lián)系的比較緊密，只要鏈表弄明白了，相信棧的算法也不會太難理解的。。。

棧算法的代碼如下：

//
//  main.m
//  棧程序
//
//  Created by 小伴 on 16/7/24.
//  Copyright ? 2016年 huangqimeng. All rights reserved.
//

#import <Foundation/Foundation.h>

#include <stdio.h>
#include <malloc/malloc.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node *pNext;
}NODE, *PNODE;

typedef struct Stack {
    PNODE pTop;
    PNODE pBottom;
}STACK, *PSTACK;  //PSTACK等價于 struct STACK *

void initStack(PSTACK);
void pushStack(PSTACK, int);
void traverse(PSTACK);
bool popStack(PSTACK, int *);
void clearStack(PSTACK);

int main(int argc, const char * argv[]) {
    @autoreleasepool {
        STACK S;  //STACK 等價于 struct Stack
        int val;

        initStack(&S);
        pushStack(&S, 1);
        pushStack(&S, 2);
        pushStack(&S, 3);
        pushStack(&S, 4);
        pushStack(&S, 5);
        traverse(&S);

        if (popStack(&S, &val)) {
            printf("出棧成功，出棧的元素為：%d\n", val);
        } else {
            printf("出棧失敗\n");
        }
        traverse(&S);

        clearStack(&S);
        traverse(&S);
    }
    return 0;
}

/**
 * 初始化一個空棧
 */
void initStack(PSTACK pS) {
    pS->pTop = (PNODE)malloc(sizeof(NODE));
    if (pS->pTop == NULL) {
        printf("動態(tài)內(nèi)存分配失敗\n");
        exit(-1);
    } else {
        pS->pBottom = pS->pTop;
        pS->pTop->pNext = NULL;  //pS->pBottom->pNext = NULL;
    }
}

/**
 *  壓棧
 */
void pushStack(PSTACK pS, int val) {
    PNODE pNew = (PNODE)malloc(sizeof(NODE));

    pNew->data = val;
    pNew->pNext = pS->pTop; //pS->pTop不能換作pS->pBottom
    pS->pTop = pNew;
}

void traverse(PSTACK pS) {
    PNODE p = pS->pTop;
    while (p != pS->pBottom) {
        printf("%d ", p->data);
        p = p->pNext;
    }
    printf("\n");
}

bool empty(PSTACK pS) {
    if (pS->pTop == pS->pBottom) {
        return true;
    } else {
        return false;
    }
}

/**
 *  把pS指向的棧出棧一次，并把出棧的元素存入pVal形參所指向的變量中，如果出棧失敗返回false，否則返回true
 */
bool popStack(PSTACK pS, int *pVal) {
    if (empty(pS)) {//pS本身存放的就是S的地址
        return false;
    } else {
        PNODE temp = pS->pTop;
        *pVal = temp->data;
        pS->pTop = temp->pNext;
        free(temp);
        temp = NULL;

        return true;
    }
}

//棧清空
void clearStack(PSTACK pS) {
    if (!empty(pS)) {
        PNODE p = pS->pTop;
        PNODE q = NULL;
        while (p != pS->pBottom) {
            q = p->pNext;
            free(p);
            p = q;
        }
        pS->pTop = pS->pBottom;
    }
}