Reverse Linked List

c++

/**
 * 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) {
        if (head == nullptr || head->next == nullptr)
            return head;
        ListNode* node = nullptr;
        while (head != nullptr) {
            ListNode* nxt = head->next;
            head->next = node;
            node = head;
            head = nxt;
        }
        return node;
    }
};

python

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head or not head.next:
            return head

        node = None
        while head:
            nxt = head.next
            head.next = node
            node = head
            head = nxt
        return node