# 0708. Insert into a Sorted Circular Linked List

https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list

## Description

Given a Circular Linked List node, 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 necessarily be 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., the 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 originally given node.

**Example 1:**

![](https://assets.leetcode.com/uploads/2019/01/19/example_1_before_65p.jpg)\


```
**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.
![](https://assets.leetcode.com/uploads/2019/01/19/example_1_after_65p.jpg)
```

**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.
```

**Example 3:**

```
**Input:** head = [1], insertVal = 0
**Output:** [1,0]
```

**Constraints:**

* `0 <= Number of Nodes <= 5 * 104`
* `-106 <= Node.val, insertVal <= 106`

## ac

```java
class Solution {
    public Node insert(Node head, int insertVal) {
        Node insertNode = new Node(insertVal);
        if (head == null) {
            insertNode.next = insertNode;
            return insertNode;
        }
        
        Node curr = head, next = curr.next;
        while (true) {
            /*
            E.g. [2,4,6]
            1. insert in the middle: insertVal = 3;
            2. insert before head: insertVal = 1;
            3. insert after tail: insertVal = 7;
            */
            if (curr.val <= insertVal && insertVal <= next.val
                || curr.val > next.val && insertVal <= next.val
                || curr.val > next.val && insertVal >= curr.val) {
                curr.next = insertNode;
                insertNode.next = next;
                return head;
            }
            
            if (next == head) break; // After 1 pass, still cannot insert.
            
            curr = next;
            next = next.next;
        }
        
        // Cannot insert: all values are the same and not equal to insertVal.
        insertNode.next = head.next;
        head.next = insertNode;
        
        return head;
    }
}
// O(N) time. Tricky edge cases.
```
