思路
模拟即可。 
代码

class Solution {
    public int[] nodesBetweenCriticalPoints(ListNode head) {
        if (head.next == null || head.next.next == null) {
            return new int[]{ -1, -1 };
        }
        int mnDist = Integer.MAX_VALUE;
        int mxDist = 0;
        int idx = 0;
        int last = head.val;
        int first = -1;
        int lastIdx = -1;
        ListNode cur = head.next;...