快慢指针的边界问题

输入链表头节点：要求如下 👇

          1.奇数长度返回中点，偶数长度返回上中点
          2.奇数长度返回中点，偶数长度返回下中点
          3.奇数长度返回中点前一个，偶数长度返回上中点前一个
          4.奇数长度返回中点前一个，偶数长度返回下中点前一个

        涉及链表的操作时"快慢指针"是最基础的技巧，对其边界的把握也要非常熟练！

package com.kali.link;

/**
 * 快慢指针：
 *      输入链表头节点：
 *          1.奇数长度返回中点，偶数长度返回上中点
 *          2.奇数长度返回中点，偶数长度返回下中点
 *          3.奇数长度返回中点前一个，偶数长度返回上中点前一个
 *          4.奇数长度返回中点前一个，偶数长度返回下中点前一个
 */
//TODO : FINISH IT !!!
public class LinkedListMidQuestion {
    public static void main(String[] args) {
        int[] arr = {23,12,1,4,65,67};
        MyLinked link = new MyLinked();
        link.add(arr);
        Node head = link.getHead();

        System.out.println(midUpMid(head));

        System.out.println(midDownMid(head));

        System.out.println(PreOfMidPreOfUpMid(head));

        System.out.println(PreOfMidPreOfDownMid(head));
    }

    /*1.奇数返回中点，偶数返回上中点*/
    public static Node midUpMid(Node head){
        if(head == null || head.next == null || head.next.next == null){
            return head;
        }
        //快慢指针
        Node slow = head;
        Node fast = head;
        // 1 1 1 1
        // 0 0 0 0 0 0 0 0
        // 1   1   1   1
        while(fast.next != null && fast.next.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }

    /*2.奇数返回中点，偶数返回下中点*/
    public static Node midDownMid(Node head){
        if(head == null){
            return null;
        }
        if(head.next == null || head.next.next == null){
            return head.next;
        }
        Node slow = head;
        Node fast = head.next;
        // 1 1 1 1
        // 0 0 0 0 0 0 0 0 0
        //   1   1   1   1
        while(fast.next != null && fast.next.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow.next;
    }

    /*3.奇数长度返回中点前一个，偶数长度返回上中点前一个*/
    public static Node PreOfMidPreOfUpMid(Node head){
        if(head == null || head.next == null || head.next.next == null){
            return null;
        }
        Node slow = head;
        Node fast = head.next.next;
        // 1 1 1
        // 0 0 0 0 0 0 0 0
        //     1   1   1
        while(fast.next != null && fast.next.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }

    /*4.奇数长度返回中点前一个，偶数长度返回下中点前一个*/
    public static Node PreOfMidPreOfDownMid(Node head){
        if(head == null || head.next == null){
            return null;
        }
        if(head.next.next == null){
            return head;
        }
        Node slow = head;
        Node fast = head.next;
        // 1 1 1 1
        // 0 0 0 0 0 0 0 0 0
        //   1   1   1   1
        while(fast.next != null && fast.next.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }
}

        慢指针始终从head开始，变化的只有快指针的起始位置，返回的也可能是慢指针的下一个节点，视情况而定。