苏嵌 项目实战
学习日志 姓名:赵文飞 日期:9.11
今日学习任务 了解栈的用法和编写程序的注意点
今日任务完成情况 一步步跟着老师编写程序,虽然有点多,但还是可以跟上老师的步骤,完成代码量200+
今日开发中出现的问题汇总 基本储备、线性结构存储方式
今日未解决问题 程序编写和理解毕节困难
今日开发收获
#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;
}