链表——返回不同条件下的中点位置

目录

1.输入链表头节点，奇数长度返回中点，偶数长度返回上中点

2.输入链表头节点，奇数长度返回中点，偶数长度返回下中点

3.输入链表头节点，奇数长度返回中点前一个，偶数长度返回上中点前一个

4.输入链表头节点，奇数返回中点前一个，偶数长度返回下中点前一个

---

    public static class Node{
        public int value;
        public Node next;

        public Node(int v){
            value = v;
        }
    }

1.输入链表头节点，奇数长度返回中点，偶数长度返回上中点

        方法一：

    public static  Node right1(Node head){
        if (head==null)
            return null;
        Node cur = head;
        ArrayList<Node> arr = new ArrayList<>();
        while (cur!=null){
            arr.add(cur);
            cur = cur.next;
        }
        return arr.get((arr.size()-1)/2);
    }

        方法二：

    public static Node midOrUpMidNode(Node head){
        if (head==null||head.next==null||head.next.next==null)
            return head;
        Node slow = head.next;
        Node fast = head.next.next;
        while (fast.next!=null&&fast.next.next!=null){
            slow = slow.next;
            fast=fast.next.next;
        }
        return slow;
    }

2.输入链表头节点，奇数长度返回中点，偶数长度返回下中点

        方法一：

    public static Node right2(Node head){
        if (head == null)
            return null;
        Node cur = head;
        ArrayList<Node> arr = new ArrayList<>();
        while (cur!=null){
            arr.add(cur);
            cur = cur.next;
        }
        return arr.get(arr.size()/2);
    }

        方法二：

    public static Node midOrDownMidNode(Node head){
        if (head==null||head.next==null||head.next.next==null)
            return head;
        Node slow = head.next;
        Node fast = head.next;
        while (fast.next!=null&&fast.next.next!=null){
            slow = slow.next;
            fast=fast.next.next;
        }
        return slow;
    }

3.输入链表头节点，奇数长度返回中点前一个，偶数长度返回上中点前一个

        方法一：

    public static Node right3(Node head){
        if (head==null ||head.next==null||head.next.next==null)
            return null;
        Node cur = head;
        ArrayList<Node> arr = new ArrayList<>();
        while (cur!=null){
            arr.add(cur);
            cur=cur.next;
        }
        return arr.get((arr.size()-3)/2);
    }

        方法二：

    public static Node midOrUpMidPreNode(Node head){
        if (head==null||head.next==null||head.next.next==null)
            return head;
        Node slow = head;
        Node fast = head.next.next;
        while (fast.next!=null&&fast.next.next!=null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }

4.输入链表头节点，奇数返回中点前一个，偶数长度返回下中点前一个

        方法一：

    public static Node right4(Node head){
        if (head==null||head.next==null){
            return null;
        }
        Node cur = head;
        ArrayList<Node> arr = new ArrayList<>();
        while (cur!=null){
            arr.add(cur);
            cur=cur.next;
        }
        return arr.get((arr.size()-2)/2);
    }

        方法二：

    public static Node midOrDownMidPreNode(Node head){
        if (head==null||head.next==null){
            return null;
        }
        if (head.next.next==null){
            return head;
        }
        Node slow = head;
        Node fast = head.next;
        while (fast.next!=null&&fast.next.next!=null){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }