9月11日学习日志

---

9月11日学习日志

---

今日编写的程序：
1、stack.h栈的头文件

#ifndef STACK_H
#define STACK_H

#define MAXSIZE     10
#define SUCCESS     1000
#define FAILURE     1001

struct stack
{
    int data[MAXSIZE];
    int top;
};
typedef struct stack S;

#endif

---

2、main.c主函数

#include<stdio.h>
#include"stack.h"

int main()
{
    S stack;
    int ret,i;
    ret = InitStack(&stack);
    if(SUCCESS == ret)
    {
        printf("Init Success!\n");
    }
    else
    {
        printf("Init Failure!\n");
    }
    for(i=0;i<5;i++)
    {
        ret = push(&stack,i + 1);
        if(SUCCESS == ret)
        {
            printf("push %d success!\n",i + 1);
        }
        else
        {
            printf("push failure!\n");
        }
    }
    for(i=0;i<3;i++)
    {
        ret = pop(&stack);
        if(ret == FAILURE)
        {
            printf("pop failure!\n");
        }
        else
        {
            printf("pop %d success!\n",ret);
        }
    }
    ret = EmptyStack(stack);
    if(ret == SUCCESS)
    {
        printf("stack is empty!\n");
    }
    else
    {
        printf("stack is not empty!\n");
    }
    ret = GetTop(stack);
    if(ret == FAILURE)
    {
        printf("Get Top Failure!\n");
    }
    else
    {
        printf("Top %d\n",ret);
    }
    ret = ClearStack(&stack);
    if(ret == FAILURE)
    {
        printf("clear failure!\n");
    }
    else
    {
        printf("clear success!\n");
    }
    ret = EmptyStack(stack);
    if(ret == SUCCESS)
    {
        printf("stack is empty!\n");
    }
    else
    {
        printf("stack is not empty!\n");
    }

    return 0;
}

---

3、stack.c栈的操作函数（初始化栈、进栈、出栈、判断栈是否空、获取栈顶元素、清空栈）

#include"stack.h"
#include<stdio.h>
int InitStack(S *s)
{
    if(NULL == s)
    {
        return FAILURE;
    }
    s->top = -1;
    return SUCCESS;
}
int push(S *s,int e)
{
    if(NULL == s)
    {
        return FAILURE;
    }
    if(s->top == MAXSIZE - 1)
    {
        return FAILURE;
    }
    s->data[s->top + 1]=e;
    s->top++;
    return SUCCESS;
}
int pop(S *s)
{
    if(NULL == s)
    {
        return FAILURE;
    }
    if(-1 == s->top)
    {
        return FAILURE;
    }
    int e = s->data[s->top];
    s->top--;
    return e;
}
int EmptyStack(S s)
{
    return (s.top == -1) ? SUCCESS : FAILURE;
}
int GetTop(S s)
{
    if(s.top == -1)
    {
        return FAILURE;
    }
    return s.data[s.top];
}
int ClearStack(S *s)
{
    if(NULL == s)
    {
        return FAILURE;
    }
    s->top = -1;
    return SUCCESS;
}

---

运行结果：

---