函数题

函数题

6-1 单链表逆转

List Reverse(List L)
{
   
	List head, tail, mid;
	tail = NULL;
	mid = L;

	while (mid != NULL)
	{
   
		head = mid->Next;
		mid->Next = tail;
		tail = mid;
		mid = head;
		
	}

	return tail;
}

6-2 顺序表操作集

List MakeEmpty(){
   
	List L;
	L=(List)malloc(sizeof(struct LNode));
	L->Last=-1;
	return L;
} 
Position Find( List L, ElementType X ){
   
	Position i=0;
	while(i<=L->Last&&L->Data[i]!=X)
	      i++;
	    if(i>L->Last) return ERROR;
	    else return i;
}
bool Insert( List L, ElementType X, Position P ){
   
     Position i;
     if(L->Last==MAXSIZE-1){
   
     	printf("FULL");
        return false;
	 }
	if(P<0||P>L->Last+1){
   
		printf("ILLEGAL POSITION");
		return false;
	}
	for(i=L->Last;i>=P;i--)
		L->Data[i+1]=L->Data[i];
		L->Data[P]=X;
		L->Last++;
		return true; 
}
bool Delete( List L, Position P ){
   
	Position j;
	if(P<0||P>L->Last){
   
		printf("POSITION %d EMPTY",P);
		return false;
	}
	for(j=P;j<L->Last;j++)
	   L->Data[j]=L->Data[j+1];
	   L->Last--;
	   return true;
}

6-3 链式表的按序号查找

ElementType FindKth( List L, int K )
{
   
    if(L==NULL) 
      return ERROR;   
    while(--K)                //此处用k--会报错，注意前缀和后缀区别
    {
   </