最近得了学长推荐找了本很好的数据结构教程,《大话数据结构》,大家一块学习进步。。。
#include<stdio.h>
#include<stdlib.h>
#define MaxSize 100;
typedef int SlemType;
typedef int Status;
typedef struct{
SlemType date[MaxSize];
int length;
}Sqlist;
Status Initlist(Sqlist *S)
{
S.lenth=0;
return 1;
}
Status Listempty(Sqlist S)
{
if(S.list==0)
return 0;
else
return 1;
}
Status Clearlist(Sqlist *S)
{
S.length=0;
}
status GetElem(Sqlist S,int i,ElemType &e)
{
if(S.length==0||i<0||i>S.length)
return 0;
else
e=S.date[i-1];
return 1
}
status Listlength(Sqlist S)
{
return S.length;
}
status LocateElem(Sqlist S,ElemType e)
{
if(S.length==0)
return 0;
for(i=0;i<=S.length-1;i++)
if(e==S.date[i])
return i+1;
return 0;
}
status ListInsert(Sqlist *s,int i,Elemtype e)//
{
int k;
if(S.length==MaxSize)
return 0;
if(i>S.length+1||i<1)
return 0;
if(i<=S.length)
{
for(k=S.length-1;k>=i-1;k--)
S.date[k+1]=S.date[k];
}
S.date[i-1]=e;
S.length++;
return 0;
}
status ListDelete(Sqlist *s,int i,Elemtype &e)
{
int k;
if(S.length==0)
return 0;
if(i<0||i>S.length)
return 0;
e=S.date[i-1];
for(k=i-1;k<=S.length-1;k++)
S.date[k]=S.date[k+1];
S.length--;
return 0;
}
status Listlength(Sqlist S)
{
return S.length;
}