LeetCode 链表的中间结点

Posted 2021-09-13 xhBruce

876. 链表的中间结点

---

count 统计ListNode，折半循环查找链表节点

/**
 * 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 node = head;
        int count = 0;
        while (node != null) {
            count++;
            node = node.next;
        }

        count = count / 2;
        while (count-- > 0) {
            //System.out.println(count);
            head = head.next;
        }
        return head;
    }
}