206. Reverse Linked List

Description

https://leetcode.com/problems/reverse-linked-list/
反转单向链表

Solving Ideas

https://leetcode.com/problems/reverse-linked-list/solution/

时间复杂度：$O(n)$
空间复杂度：$O(1)$

Solution

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

/**
 * Time complexity : O(n)
 * Space complexity : O(n)
 */
class Solution {
	public ListNode reverseList(ListNode head) {
	    if (head == null || head.next == null) return head;
	    ListNode newHead = reverseList(head.next);
	    head.next.next = head;
	    head.next = null;
	    return newHead;
	}
}