4-1 单链表逆转
code:
List Reverse(List head)
{
if(NULL==head|| NULL==head->Next)
return head;
List p;
List q;
List r;
p = head;
q = head->Next;
head->Next = NULL;
while(q){
r = q->Next;
q->Next = p;
p = q;
q = r;
}
head=p;
return head;
}
P.S:就是一个反转链表,不是很难,耐心写就可以写完了
4-2 顺序表操作集
code:
Position Find( List L, ElementType X )
{
List r = L;
while(r!=NULL && X!=r->Data)
{
r = r->Next;
}
if( r && X==r->Data)
return r;
else
return ERROR;
}
List Insert( List L, ElementType X, Position P )
{
if(L==NULL)
{
if(P!=L) {
printf(