【leetcode】【easy】206. Reverse Linked List​​​​​​​

206. Reverse Linked List

Reverse a singly linked list.

Example:

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?

题目链接：https://leetcode.com/problems/reverse-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* last = NULL, *next = head->next;
        while(true){
            head->next = last;
            last = head;
            if(next==NULL) break;
            head = next;
            next = next->next;
        }
        return last;
    }
};