栈，递归

• 栈的基本操作

注意：是从后往前连接的

#include <stdio.h>
#include <Windows.h>
typedef struct sStack
{
    int num;
    struct sStack* pnext;
}Stack;
void push(Stack **pStack,int num);
int pop(Stack **pStack);
BOOL isEmpty(Stack *pStack);

int main()
{
    Stack* pStack = NULL;
     push(&pStack,1);
     push(&pStack,2);
     push(&pStack,3);
     printf("%d
",pop(&pStack));
     printf("%d
",pop(&pStack));
     printf("%d
",pop(&pStack));
     printf("%d
",pop(&pStack));
    if( isEmpty(pStack))
        printf("栈为空
");
     return 0;
}
void push(Stack **pStack,int num)
{
    Stack* stack = (Stack*)malloc(sizeof(Stack));
    stack->num = num;
    stack->pnext = NULL;

    stack->pnext = *pStack;
    *pStack = stack;
    //不需要判断栈是否为空，直接push就好
}
int pop(Stack **pStack)
{
    int a = 0;
    Stack* temp;
    if(isEmpty( *pStack))
        return -1;
    a = (*pStack)->num;
    temp = *pStack;
    (*pStack) = (*pStack)->pnext;
    free(temp);//弹出之后要删除
    return a;
}
BOOL isEmpty(Stack *pStack)
{
    if(pStack == NULL)
        return TRUE;
    else 
        return FALSE;
}基本操作

•  递归

#include <stdio.h>
int JIECHENG(int);
void Out(int,int );
int main()
{
    printf("%d
",JIECHENG(5));
    Out(1,4);
    return 0;
}
int JIECHENG(int num)
{
    if(num == 1)
    {
        return 1;
    }
    else return num*JIECHENG(num-1);
}
void Out(int begin,int end)
{
    if(begin <= end)
    {
        printf("%d
",begin);
        Out(begin+1,end);
        printf("%d
",begin);
    }
}