Leetcode: Reverse Linked List



Reverse a singly linked list.

最简单的，上学的时候感觉还比较难懂。

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:    ListNode* reverseList(ListNode* head) {        ListNode* prev = nullptr;        ListNode* cur = head;        ListNode* tmp = nullptr;        while (cur != nullptr) {            tmp = cur->next;            cur->next = prev;            prev = cur;            cur = tmp;        }                return prev;    }};