LeetCode-876 Middle of the Linked List Solution (with Java)

1. Description:

Notes: 

2. Examples:

3.Solutions:

/**
 * Created by sheepcore on 2019-05-10
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode middleNode(ListNode head) {
        List<Integer> list = new ArrayList<>();
        ListNode listNode = head;
        listNode = head.next;

        int len = 0;
        
        while (listNode != null){
            len++;
            listNode = listNode.next;
        }
   
        listNode = head;
        if(len % 2 == 0){
            for(int i = 0; i < len >> 1; i++){
                listNode = listNode.next;
            }
        } else{
            for(int i = 0; i <= len >> 1; i++){
                listNode = listNode.next;
            }     
        }
        return listNode;
    }
}