有序升序环链表，找到最小头

        Node newhead = null;
        Node slow = head;
        Node fast = head.next;
        while(fast.val >= slow.val){
            slow = slow.next;
            fast = fast.next;
            if(fast == head){
                break;
            }
        }

然后从新头找到元素位置插入即可