50-不定长顺序表

# include<stdio.h>
# include<malloc.h>
# include<string.h>
# include<stdlib.h>
# define INITSIZE 100
typedef int ElemType;

typedef struct  SqList//定义结构体
{
	ElemType *data;
	int length;
	int size;
}SqList;


static int  AppendSpace(SqList *sq)//扩容
{
	ElemType *s =(ElemType *)malloc(sizeof(ElemType) * sq->size *2);
	if(s == NULL) return -1;
	for(int i =0;i<sq->size ;++i)
	{
		s[i]=sq->data[i];
	}
	free(sq->data);
	sq->data =s;
	sq->size *=2;
	return 0;

}
void InitSqList(SqList *sq)//初始化 
{
	if (sq == NULL)
		{
			exit(0);
	}
	sq->data =(ElemType*)malloc(sizeof(ElemType) *INITSIZE);
	if(sq->data ==NULL)
	{
		exit(0);	
	}
	sq->length =0;
	sq->size =INITSIZE;
}

void  InsertSqListPos(SqList *sq ,ElemType  val,int pos)//按位置插入 
{
	if (sq == NULL) exit(0);
	if(pos <0 || pos >sq->length)
	{
		printf("Insert ::Pos is error \n");
	return ;
	}
	if(sq->length == sq->size);
	{
	if(-1 == AppendSpace(sq))
	{
		printf("Insert::AppendSpace fail\n");
			return;
	}
	}
	for(int i = sq->length; i>pos; i-- )
	{
		sq->data[i] = sq->data[i-1];
	}
	sq->data[pos] =val;
	sq->length++;
	
}

void  SqListShow(SqList *sq)//输出 
{
	if(sq ==NULL) return;
	for(int i =0; i< sq->length ; ++i)
	{
		printf("%d:%d \n",i,sq->data[i]);
	}
}


void SqListInsertHead(SqList *sq,ElemType val)//头插 
{
	InsertSqListPos(sq , val ,0);

}

void SqListInsertTail(SqList *sq,ElemType val)//尾插 
{
	if(sq ==NULL) exit(0);
	InsertSqListPos(sq ,val,sq->length);
}

void SqListDeletePos(SqList *sq , int  pos)//按位置删 
{
	if(sq ==NULL) exit(0);
	if(pos < 0 || pos >=sq->length)
	{
		printf("Delete ::Pos is error\n");
			return;
	}
	for(int i =pos; i < sq->length-1; ++i)
	{
		sq->data[i]  = sq->data[i +1];
	}
	sq->length--;
}

void SqListDeleteHead(SqList *sq)//头删 
{
	SqListDeletePos(sq,0);
}

void SqListDeleteTail(SqList *sq)//尾删 
{
	if(sq ==NULL) exit(0);
	if(sq->length ==0) return;
	sq->length--;

}

//void SqListDeleteValue1(SqList *sq,ElemType val )
//{
//	if(sq ==NULL) exit(0);
//
//	for(int i=0; i<sq->length;)
//	{
//		if(val == sq->data[i]);
//		{
//			SqListDeletePos(sq,i);
//		}
//		else
//		{
//			i++;
//		}
//	}
//}
void SqListDeleteValue2(SqList *sq,ElemType val)
{
  if(sq ==NULL) exit(0);
  int count=0;
  for(int i=0;i <sq->length;)
  {
      sq->data[i] =sq->data[i+count];
	  if(val ==sq->data[i])
	  {
	  count++;
	  }
	 else
	 {
	  i++;
	  }
	  
  }
  sq->length -=count;
}


void FindValueList(SqList *sq,ElemType val)//寻找 
{
	if(sq ==NULL) exit(0);
	int index =-1;
	for(int i=0; i<sq->length;++i)
	{
		if(sq->data[i] ==val)
		{
		    index= i;
		}
	}
	return index;
}
void DestroySqList(SqList *sq)//销毁 
{
  if(sq == NULL) exit(0);
  free(sq->data);
  sq->data =NULL;
  sq->length =0;

}