Reverse Linked List

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) {        if(head==NULL||head->next==NULL)            return head;        ListNode* cur = head->next;        head->next = NULL;        while(cur!=NULL)        {            ListNode* tmp = cur->next;            cur->next = head;            head = cur;            cur = tmp;        }        return head;    }};

代码递归