顺序表
来源:互联网 发布:linux ld.so.cache 编辑:程序博客网 时间:2024/06/08 16:25
#include<stdio.h>
#include "SequenceList.h"
void print(ElemType *e)
{
printf("%d\n", *e);
}
int main()
{
int ret, i;
SqList list;
ret = InitList(&list);
if (FAILURE == ret)
{
printf("INIT FAILURE!\n");
}
else
{
printf("INIT SUCCESS!\n");
}
ret = ListEmpty(&list);
if (TRUE == ret)
{
printf("List is empty!\n");
}
else
{
printf("List is not empty");
}
for (i = 1; i <= 5; i++)
{
ret = ListInsert(&list, i, i);
if (FAILURE == ret)
{
printf("INSERT %d FAILURE!\n", i);
}
else
{
printf("INSERT %d SUCCESS!\n", i);
}
}
ret = ListTraverse(&list, print);
if (FAILURE == ret)
{
printf("TRAVERSE FAILURE!\n");
}
else
{
printf("TRAVERSS SUCCESS!\n");
}
return 0;
}
#include "SequenceList.h"
void print(ElemType *e)
{
printf("%d\n", *e);
}
int main()
{
int ret, i;
SqList list;
ret = InitList(&list);
if (FAILURE == ret)
{
printf("INIT FAILURE!\n");
}
else
{
printf("INIT SUCCESS!\n");
}
ret = ListEmpty(&list);
if (TRUE == ret)
{
printf("List is empty!\n");
}
else
{
printf("List is not empty");
}
for (i = 1; i <= 5; i++)
{
ret = ListInsert(&list, i, i);
if (FAILURE == ret)
{
printf("INSERT %d FAILURE!\n", i);
}
else
{
printf("INSERT %d SUCCESS!\n", i);
}
}
ret = ListTraverse(&list, print);
if (FAILURE == ret)
{
printf("TRAVERSE FAILURE!\n");
}
else
{
printf("TRAVERSS SUCCESS!\n");
}
return 0;
}
阅读全文
0 0
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 顺序表
- 数据库索引
- segment tree template
- BZOJ 2850 巧克力王国
- jsp页面中frameset的使用方法
- 山大场馆管理系统 开发日志2
- 顺序表
- Roman to Integer 【LeetCode】
- 顺序表
- 组合模式(Composite Pattern)
- 486. Predict the Winner
- LeetCode -- 5. Longest Palindromic Substring
- 算法设计与应用基础
- 织梦搜索结果标题显示不全的解决方法
- 微信中原来有两种纵向滚动条