leetcode_206_Reverse Linked List(easy)(C++)

Reverse a singly linked list.

click to show more hints.

Hint:

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

思路：使用头插法迭代插入

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