单链表反转
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
struct ListNode { int value; ListNode* next; ListNode(int v):value(v), next(nullptr) { } }; class Solution { public: ListNode* ReverseList(ListNode* head) { if (!head) { return nullptr; } ListNode* temp = nullptr; ListNode* cur = head; while (cur) { ListNode* next =head->next; cur->next = temp; temp = cur; cur = next; } return temp; } } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
struct Node { int data; struct Node* next; }; Node* Reserve(Node* head) { Node* pre = NULL; Node* next = NULL; while(head != NULL) { next = head->next; head->next = pre; pre = head; head = next; } return pre; } |
本文为原创文章，版权归Aet所有，欢迎分享本文，转载请保留出处！
你可能也喜欢
- ♥ 2020_04_2204/23
- ♥ 后端知识点记述 一09/08
- ♥ 2022_02_1802/18
- ♥ 2022_03_0103/01
- ♥ 2022_02_1602/16
- ♥ 2022_03_0903/09
热评文章
- 2025_03_11 0
- 2020_04_29 0
- 2022_02_26 0
- 2025_03_18 0
- 2020_04_28 0
- 2022_03_09 0