Check length, Java beats 100%!
First, we find the length of linked list; then find the middle point and get that node.    \n\n\tpublic ListNode middleNode(ListNode head) {\n        ListNode c
First, we find the length of linked list; then find the middle point and get that node.    \n\n\tpublic ListNode middleNode(ListNode head) {\n        ListNode curr = head;\n        \n        int total = 0;\n        while(curr != null){\n            total++;\n            curr = curr.next;\n        }        \n        \n        //find the middle one\n        total = total/2 + 1;\n        \n        ListNode cur = head;\n        for(int i = 1; i < total; ++i){\n            cur = cur.next;\n        }\n        \n        return cur;\n    }
['Java']