Insert into a Sorted Circular Linked List

Given a node from a Circular Linked List which is sorted in ascending order, write a function to insert a value insertVal into the list such that it remains a sorted circular list. The given node can be a reference to any single node in the list, and may not be necessarily the smallest value in the circular list.

If there are multiple suitable places for insertion, you may choose any place to insert the new value. After the insertion, the circular list should remain sorted.

If the list is empty (i.e., given node is null), you should create a new single circular list and return the reference to that single node. Otherwise, you should return the original given node.

Example 1:

Input: head = [3,4,1], insertVal = 2
Output: [3,4,1,2]
Explanation: In the figure above, there is a sorted circular list of three elements. You are given a reference to the node with value 3, and we need to insert 2 into the list. The new node should be inserted between node 1 and node 3. After the insertion, the list should look like this, and we should still return node 3.

Example 2:

Input: head = [], insertVal = 1
Output: [1]
Explanation: The list is empty (given head is null). We create a new single circular list and return the reference to that single node.

思路：insert进去点三种情况：

A. 普通情况：3 -> 5, insert 4, curNode<=insertVal<=curNode.next 这样insert在中间；

B. 边界情况：5 - > 1, insert 6 或者0， curNode>curNode.next && ( insertVal>=curNode || insertVal<=curNode.next )

C. 如果所有的点都一样，那么避免死循环 curNode.next != head, 

除了这三种情况之外的，curNode继续走，走到应该插入的地方，插入即可；

/*
// Definition for a Node.
class Node {
    public int val;
    public Node next;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, Node _next) {
        val = _val;
        next = _next;
    }
};
*/

class Solution {
    public Node insert(Node head, int insertVal) {
        if(head == null) {
            head = new Node(insertVal);
            head.next = head;
        } else {
            // head != null;
            // 3 situation:
            // A: 3 -> 5, insert 4;
            // B: 5 -> 1, insert front or backend, like insert 6, or insert 0;
            Node cur = head;
            while(! (cur.val < cur.next.val && (cur.val <= insertVal && insertVal <= cur.next.val))
                 && !(cur.val > cur.next.val && (insertVal >= cur.val || insertVal <= cur.next.val))
                 && (cur.next != head)) { // // 最后一种情况是：所有的点都一样，避免形成死循环；
                cur = cur.next;
            }
            Node newnode = new Node(insertVal);
            Node curnext = cur.next;
            cur.next = newnode;
            newnode.next = curnext;
        }
        return head;
    }
}