876. Middle of the Linked List

题目描述

Given a non-empty, singly linked list with head node head, return a middle node of linked list.

If there are two middle nodes, return the second middle node.

Example 1:

Input: [1,2,3,4,5]
Output: Node 3 from this list (Serialization: [3,4,5])
The returned node has value 3. (The judge’s serialization of this node is [3,4,5]).
Note that we returned a ListNode object ans, such that:
ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.

Example 2:

Input: [1,2,3,4,5,6]
Output: Node 4 from this list (Serialization: [4,5,6])
Since the list has two middle nodes with values 3 and 4, we return the second one.

Note:

The number of nodes in the given list will be between 1 and 100.

方法思路

Approach 1: Output to Array

Complexity Analysis

Time Complexity: O(N), where N is the number of nodes in the given list.

Space Complexity: O(N), the space used by A. 

class Solution {
    public ListNode middleNode(ListNode head) {
        //Runtime: 1 ms, faster than 84.24% of Java
        //Memory Usage: 36.9 MB, less than 5.43% of Java
        ListNode[] A = new ListNode[100];
        int t = 0;
        while (head != null) {
        //注意此处的判定为条件为head != null
        //不是head.next != null
            A[t] = head;
            t++;//t最终的数值为链表的长度
            head = head.next;
        }
        return A[t / 2];
    }
}

Approach 2: Fast and Slow Pointer

Complexity Analysis

Time Complexity: O(N), where N is the number of nodes in the given list.

Space Complexity: O(1), the space used by slow and fast. 

class Solution{
    //Runtime: 0 ms, faster than 100.00% of Java 
    //Memory Usage: 36.7 MB, less than 67.20% of Java
    public ListNode middleNode(ListNode head){
        ListNode slow = head;
        ListNode fast = head;
        
        while(fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }
}