
思路:把curr-next的节点,插入到链表头,直到curr-next == NULL
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
|
LinkList reverse(LinkList L) { if(L == NULL ) return NULL; LinkList curr,pnext; curr = L->next; while(curr->next != NULL) { pnext = curr->next; curr->next = pnext->next; pnext->next = curr; L->next = pnext; } return L;
}
|
近期评论