LeetCode-Reverse Linked List

Description：
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?

题意：将一个单链表逆序；

解法：将一个单链表逆序，我们可以从首节点开始，将每个节点都指向其前一个节点，以及来实现逆序；这里，我们定义个遍历pre来存储前一个节点；

Java-递归

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    ListNode pre = null;
    public ListNode reverseList(ListNode head) {
        if (head == null) return head;
        if (head.next == null) {
            head.next = pre;
            return head;
        }
        ListNode temp = head.next;
        head.next = pre;
        pre = head;
        return reverseList(temp);
    }
}

Java-迭代

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        if (head == null) return head;
        ListNode pre = null;        
        while (head.next != null) {
            ListNode temp = head.next;
            head.next = pre;
            pre = head;
            head = temp;
        }
        head.next = pre;
        return head;
    }
}