表的顺序实现
时间：2009-03-28 来源：jia_killer
#define MAXSIZE 50
typedef struct{
int data[MAXSIZE];
int size;
}LinerLink; void InsertLink(LinerLink *line, int temp, int position)
{
int i=line->size;
if(position>line->size)
printf("输入错误,位置过大\n\n");
else
{
for(;i>position;i--)
{
line->data[i]=line->data[i-1];
}
line->size++;
line->data[position]=temp;
}
} void DeleteLink(LinerLink *line, int position)
{
if(position>line->size)
printf("输入错误,位置过大\n\n");
else
{
for(;position<line->size;position++)
{
line->data[position-1]=line->data[position];
}
line->size--;
}
}
typedef struct{
int data[MAXSIZE];
int size;
}LinerLink; void InsertLink(LinerLink *line, int temp, int position)
{
int i=line->size;
if(position>line->size)
printf("输入错误,位置过大\n\n");
else
{
for(;i>position;i--)
{
line->data[i]=line->data[i-1];
}
line->size++;
line->data[position]=temp;
}
} void DeleteLink(LinerLink *line, int position)
{
if(position>line->size)
printf("输入错误,位置过大\n\n");
else
{
for(;position<line->size;position++)
{
line->data[position-1]=line->data[position];
}
line->size--;
}
}
相关阅读 更多 +
