链表的反转.doc

(1)已知链表的头结点head,写一个函数把这个链表逆序 ( Intel) Node * ReverseList(Node *head) //链表逆序{if ( head == NULL || head-next == NULL )return head;Node *p1 = head ;Node *p2 = p1-next ;Node *p3 = p2-next ;p1-next = NULL ;while ( p3 != NULL ){p2-next = p1 ;p1 = p2 ;p2 = p3 ;p3 = p3-next ;}p2-next = p1 ;head = p2 ;return head ;} 链表的反转 Link Reverse(Link Head) {Link Pointer; Link Back; Link Next; Back = Head; Pinter = Back-next; Back-next = NULL; Next = Pointer-next; Pointer-next = Back; Back = Pointer; Pointer = Next; while (Pointer-next !=NULL) {Next = Pointer-next; Pointer-next = Back; Back = Poi