一、顺序栈

0、结构

typedef int Status;
typedef int SElemType; /* SElemType类型根据实际情况而定，这里假设为int */

typedef struct {
    SElemType data[MAXSIZE];
    int top; /* 用于栈顶指针 */
} SqStack;

1、创建

Status InitStack(SqStack *S) {
    S->top = -1;
    return OK;
}

2、置空

Status ClearStack(SqStack *S) {
    //只需要将标记清空即可
    S->top = -1;
    return OK;
}

3、判空

Status StackEmpty(SqStack S) {
    if (S.top == -1)
        return TRUE;
    else
        return FALSE;
}

4、长度

int StackLength(SqStack S) {
    return S.top + 1;
}

5、获取栈顶

Status GetTop(SqStack S, SElemType *e) {
    if (S.top == -1)
        return ERROR;
    else
        *e = S.data[S.top];
    return OK;
}

6、插入栈顶

Status PushData(SqStack *S, SElemType e) {
    //栈已满
    if (S->top == MAXSIZE -1) {
        return ERROR;
    }
    //栈顶指针+1;
    S->top ++;
    //将新插入的元素赋值给栈顶空间
    S->data[S->top] = e;
    return OK;
}

7、删除S栈顶元素，并且用e带回

Status Pop(SqStack *S,SElemType *e){
    //空栈,则返回error;
    if (S->top == -1) {
        return ERROR;
    }
    
    //将要删除的栈顶元素赋值给e
    *e = S->data[S->top];
    //栈顶指针--;
    S->top--;
    
    return OK;
}

8、打印

Status StackTraverse(SqStack S){
    int i = 0;
    printf("此栈中所有元素");
    while (i<=S.top) {
        printf("%d ",S.data[i++]);
    }
    printf("\n");
    return OK;
}

二、链栈

0、结构

typedef int Status;
typedef int SElemType; /* SElemType类型根据实际情况而定，这里假设为int */

typedef struct StackNode {
    SElemType data;
    struct StackNode *next;
} StackNode, *LinkStackPtr;

typedef struct {
    LinkStackPtr top;
    int count;
} LinkStack;

1、创建

Status InitStack(LinkStack *S) {
    S->top = NULL;
    S->count = 0;
    return OK;
}

2、置空

Status ClearStack(LinkStack *S) {
    LinkStackPtr p ,q;
    p = S->top;
    while (p) {
        q = p;
        p = p->next;
        free(q);
    }
    S->count = 0;
    return OK;
}

3、判空

Status StackEmpty(LinkStack S) {
    if (S.count == 0)
        return TRUE;
    else
        return FALSE;
}

4、长度

int StackLength(LinkStack S) {
    return S.count;
}

5、获取栈顶

Status GetTop(LinkStack S, SElemType *e) {
    if(S.top == NULL)
        return ERROR;
    else
        *e = S.top->data;
    return OK;
}

6、插入栈顶

Status Push(LinkStack *S, SElemType e) {
    //创建新结点temp
    LinkStackPtr temp = (LinkStackPtr)malloc(sizeof(StackNode));
    //赋值
    temp->data = e;
    //把当前的栈顶元素赋值给新结点的直接后继, 参考图例第①步骤;
    temp->next = S->top;
    //将新结点temp 赋值给栈顶指针,参考图例第②步骤;
    S->top = temp;
    S->count++;
    return OK;
}

7、删除S栈顶元素，并且用e带回

Status Pop(LinkStack *S, SElemType *e) {
    LinkStackPtr p;
    if (StackEmpty(*S)) {
        return ERROR;
    }
    
    //将栈顶元素赋值给*e
    *e = S->top->data;
    //将栈顶结点赋值给p,参考图例①
    p = S->top;
    //使得栈顶指针下移一位, 指向后一结点. 参考图例②
    S->top = S->top->next;
    //释放p
    free(p);
    //个数--
    S->count--;
    
    return OK;    
}

8、打印

Status StackTraverse(LinkStack S) {
    LinkStackPtr p;
    p = S.top;
    while (p) {
        printf("%d ",p->data);
        p = p->next;
    }
    printf("\n");
    return OK;
}

三、汉诺塔

代码实现

//n为当前盘子编号. ABC为塔盘
void Hanoi(int n ,char A,char B,char C) {
    
    //目标: 将塔盘A上的圆盘按规则移动到塔盘C上,B作为辅助塔盘;
    
    //将编号为1的圆盘从A移动到C上
    if (n==1) moves(A, 1, C);
    else {
        //将塔盘A上的编号为1至n-1的圆盘移动到塔盘B上,C作为辅助塔;
        Hanoi(n-1, A, C, B);
        //将编号为n的圆盘从A移动到C上;
        moves(A, n, C);
        //将塔盘B上的编号为1至n-1的圆盘移动到塔盘C上,A作为辅助塔;
        Hanoi(n-1, B, A, C);
    }
}

四、斐波拉契数列

代码实现

int Fbi(int i) {
    if (i < 2)
        return i == 0 ? 0 : 1;
    return Fbi(i-1) + Fbi(i-2);
}