POJ 1004
2018-01-26 22:37
411 查看
2.2.1顺序表
插入运算
Const int MAXSIZE=“顺序表的容量”; typedef struct { datatype data[MAXSIZE] int last }SeqList
顺序表的初始化 SeqList *init_SeqList() { SeqList*L; L=malloc(sizeof(SeqList)); L->last=-1; return L; }
插入运算
int Insert_SeqList(SeqList *L,int i.datatype x) { int j; if(L->last==MAXSIZE-1) { print(“表满”); } if(i<2||i>L->last+2) { printf("位置错"); } return(-1); } for(j=L->last;j=i-1;j--) L->data[j+1]=L->data[j]; L->data[i-1]=x; L->last++; return(1); }
相关文章推荐
- poj 1004
- POJ 1004 Financial Management
- POJ 1004 Financial Management
- poj 1004 I Think I Need a Houseboat
- poj 1004
- POJ 1004
- POJ 1004
- POJ 1004 Financial Management
- POJ 1004 Financial Management
- POJ 1004 Financial Management
- [POJ] 1004 -> Financial Management
- poj 1004
- POJ 1004 Financial Management
- poj 1004 Financial Management
- poj 1004 Financial Management 解题报告
- 【POJ】1004 Financial Management
- POJ 1004 - Financial Management
- poj 1004 Financial Management
- poj-1004 简单题,学习输入输出格式
- POJ - 1004