数据结构

数据结构练习其一

：

#include "stdio.h"#define MaxSize 10/*静态顺序表的各种操作向顺序表中插入元素参数Sqlist:表的首地址参数*len:表的长度参数i:插入元素的位置参数x:待插入的元素值*/int insertElem(int Sqlist[],int *len,int i,int x);int DelElem(int Sqlist[],int *len,int i);int main(int argc, char const *argv[]){    int Sqlist[MaxSize];    int len;    int i;    for (i = 0;i < 6;i++){          //从键盘输入6个整数        scanf("%d",&Sqlist[i]);    }    len = 6;    for(i = 0;i < len;i ++){        printf("%d\n",Sqlist[i]);   //顺序输出顺序表的6个整数    }    printf("The spare length is %d\n",MaxSize-len);//显示表中的剩余空间    insertElem(Sqlist,&len,3,0);    //在表中的第3个位置插入整数0    for(i = 0;i < len;i++){        printf("%d\n",Sqlist[i]);   //输出顺序表中的所有元素    }    printf("The spare length is %d\n",MaxSize-len);    insertElem(Sqlist,&len,11,0);    DelElem(Sqlist,&len,6);    for(i = 0;i < len;i++){        printf("%d\n", Sqlist[i]);    }    printf("The spare length is %d\n",MaxSize-len);    return 0;}int insertElem(int Sqlist[],int *len,int i,int x){    int t;    if(*len == MaxSize || i < 1 || i > *len+1){        printf("This insert is illegal\n");        return -1;    }    for(t = *len-1;t >= i-1;t --){          //改变顺序表要插入值的后面数据的顺序        Sqlist[t+1] = Sqlist[t];        }    Sqlist[i-1] = x;    *len = *len+1;    return 0;}int DelElem(int Sqlist[],int *len,int i){    int j;    if(i < 1 || i > *len){        printf("This dele is illegal\n");        return -1;    }    for(j = i; j <= *len-1;j++){    //改变顺序表要插入值的后面数据的顺序        Sqlist[j-1] = Sqlist[j];    }    *len = *len-1;    return 0;}... prompt'''

运行效果图