"Coding Interview Guide" -- 向有序的环形单链表中插入新节点

 1     public Node insertNum(Node head, int num)
 2     {
 3         Node node = new Node(num);
 4         if(head == null)
 5         {
 6             node.next = node;
 7             return node;
 8         }
 9 
10         Node pre = head;
11         Node cur = head.next;
12         while(cur != head)
13         {
14             if(pre.value <= num && cur.value >= num)
15             {
16                 break;
17             }
18             pre = cur;
19             cur = cur.next;
20         }
21         pre.next = node;
22         node.next = cur;
23         return head.value < num ? head : node;    
24     }