#include<stdio.h>
#include<stdlib.h>
#define list_init_size 5
#define listincrement 10
#define overflow -2
typedef int status;
typedef int elemtype;
typedef struct
{
elemtype *elem;
int length;
int listsize;
} sqlist;
status initlist_sq(sqlist &L)
{
L.elem=(elemtype *)malloc(list_init_size * sizeof(elemtype));
if(!L.elem) exit(overflow);
L.length=0;
L.listsize=list_init_size;
return 1;
}
å°é¡ºåºè¡¨åå§å为5个å
ç´ ,å¨ç»æä¸å®ä¹äºé¡ºåºè¡¨çé¿åº¦,int length:æ以å¨ä¸»å½æ°ä¸å¯ä»¥ç´æ¥è°ç¨ç¨printf("%d",L.length)å°±å¾å°äºå½åçé¿åº¦,æ 论æ¯å é¤,æ·»å ,L.lengthé½ä¼éçæ¹å,æ¯å¦æ们建ä¸ä¸ªæ·»å çå½æ°
status listinsert_sq(sqlist &L, int i ,elemtype e)
{
int * q , *p ,* newbase;
if(i<1 || i>L.length + 1) return 0;
if(L.length >= L.listsize)
{
newbase=(elemtype *)realloc(L.elem,(L.listsize+listincrement) * sizeof(elemtype));
if(!newbase) exit (overflow);
L.elem=newbase;
L.listsize+=listincrement;
}
q=&(L.elem[i-1]);
for(p=&(L.elem[L.length-1]) ;p>=q ;--p)
*(p+1) = *p;
*q = e;
++L.length;
return 1;
}
å¦æå ä¸ä¸ªå
ç´ ,å°±ä¼æL.lengthèªå¨å 1,è¿æ ·é¿å
äºååå½æ°æ±è¡¨é¿
温馨提示:答案为网友推荐,仅供参考