链表的原地逆置

链表的原地逆置(C++)

1.带头结点

LinkList Reverse_List(LinkList L) {
	LNode *p, *r;
	p = L->next;
	L->next = null;//断链，头节点和真正存储数据的结点断开
	while(p != null) {
		r = p->next;
		p->next = L->next;
		L->next = p;
		p = r;
	}

	return L;
}
1
2
3
4
5
6
7
8
9
10
11
12
13

2.不带头结点

ListNode* reverseList(ListNode* head) {
        
        ListNode *prev = nullptr;
        ListNode *curr = head;
        ListNode *next;
        while(curr != nullptr) {
            next = curr->next;
            curr->next = prev;
            prev = curr;
            curr = next;
        } 

        return prev;
    }
1
2
3
4
5
6
7
8
9
10
11
12
13
14