Leetcode - 876. Middle of the Linked List

Leetcode - 876. Middle of the Linked List

• Given the head of a singly linked list, return the middle node of the linked list.

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

Solution

func middleNode(head *ListNode) *ListNode {
    if head==nil{
        return head
    }

    fastPointer := head
    slowPointer := head

    for fastPointer!=nil && fastPointer.Next!=nil{
        slowPointer = slowPointer.Next
        fastPointer = fastPointer.Next.Next
    }

    return slowPointer
}