Middle of the Linked List LeetCode solution in Java

1
class Solution {
2
  public ListNode middleNode(ListNode head) {
3

4
    ListNode temp = head;
5
    int size = 0;
6
    while (temp != null) {
7
      size++;
8
      temp = temp.next;
9
    }
10
    int mid = size / 2;
11
    temp = head;
12
    for (int i = 0; i < mid; i++) {
13
      temp = temp.next;
14
    }
15

16
    return temp;
17
  }
18
}