[LeetCode]206. Reverse Linked List

Reverse a singly linked list.

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

public ListNode reverseList(ListNode head) {
    /* recursive solution */
    return reverseListInt(head, null);
}

private ListNode reverseListInt(ListNode head, ListNode newHead) {
    if (head == null)
        return newHead;
    ListNode next = head.next;
    head.next = newHead;
    return reverseListInt(next, head);
}