首页 > itarticle > leetcode 0206

leetcode 0206

admin 11月 13, 2020 0

Desicription

Reverse a singly linked list.

Example:

1 2	Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL

Follow up:

A linked list can be reversed either iteratively or recursively. Could you implement both?

Solution


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