链表的中间结点

题目链接

链表的中间节点

题目描述

解题思路

实现代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode middleNode(ListNode head) {
        ListNode resNode = head;
        boolean odd = true;
        while(head.next != null) {
            head = head.next;
            if(odd) {
                resNode = resNode.next;
                odd = false;
            } else {
                odd = true;
            }
        }
        return resNode;
    }
}