feat: add solutions to lc/lcof2 problems

lc No.0708 & lcof2 No.029.Insert into a Sorted Circular Linked List

Author: yanglbme

lcof2/剑指 Offer II 029. 排序的循环链表/README.md

@@ -174,44 +174,54 @@ public:
 class Solution {
 public:
     Node* insert(Node* head, int insertVal) {
-        Node* insert = new Node(insertVal);
-        if (head == nullptr) {
-            head = insert;
-            head->next = head;
-        } else if (head->next == nullptr) {
-            head->next = insert;
-            insert->next = head;
-        } else {
-            insertCore(head, insert);
+        Node* node = new Node(insertVal);
+        if (!head)
+        {
+            node->next = node;
+            return node;
         }
-
+        Node *prev = head, *curr = head->next;
+        while (curr != head)
+        {
+            if ((prev->val <= insertVal && insertVal <= curr->val) || (prev->val > curr->val && (insertVal >= prev->val || insertVal <= curr->val))) break;
+            prev = curr;
+            curr = curr->next;
+        }
+        prev->next = node;
+        node->next = curr;
         return head;
     }
+};
+```
 
-    void insertCore(Node* head, Node* insert) {
-        Node* cur = head;
-        Node* maxNode = head;
-        Node* next = head->next;
-
-        while (!(cur->val <= insert->val && insert->val <= next->val) && next != head) {
-            cur = cur->next;
-            next = next->next;
-
-            if (cur->val >= maxNode->val)
-                maxNode = cur;
-        }
-
-        if (cur->val <= insert->val && insert->val <= next->val) {
-            insert->next = next;
-            cur->next = insert;
-        } else {
-            insert->next = maxNode->next;
-            maxNode->next = insert;
+### **Go**
 
-        }
+```go
+/**
+ * Definition for a Node.
+ * type Node struct {
+ *     Val int
+ *     Next *Node
+ * }
+ */
 
-    }
-};
+func insert(head *Node, x int) *Node {
+	node := &Node{Val: x}
+	if head == nil {
+		node.Next = node
+		return node
+	}
+	prev, curr := head, head.Next
+	for curr != head {
+		if (prev.Val <= x && x <= curr.Val) || (prev.Val > curr.Val && (x >= prev.Val || x <= curr.Val)) {
+			break
+		}
+		prev, curr = curr, curr.Next
+	}
+	prev.Next = node
+	node.Next = curr
+	return head
+}
 ```
 
 ### **TypeScript**

lcof2/剑指 Offer II 029. 排序的循环链表/Solution.cpp

@@ -22,41 +22,21 @@ class Node {
 class Solution {
 public:
     Node* insert(Node* head, int insertVal) {
-        Node* insert = new Node(insertVal);
-        if (head == nullptr) {
-            head = insert;
-            head->next = head;
-        } else if (head->next == nullptr) {
-            head->next = insert;
-            insert->next = head;
-        } else {
-            insertCore(head, insert);
+        Node* node = new Node(insertVal);
+        if (!head)
+        {
+            node->next = node;
+            return node;
         }
-
-        return head;
-    }
-
-    void insertCore(Node* head, Node* insert) {
-        Node* cur = head;
-        Node* maxNode = head;
-        Node* next = head->next;
-
-        while (!(cur->val <= insert->val && insert->val <= next->val) && next != head) {
-            cur = cur->next;
-            next = next->next;
-
-            if (cur->val >= maxNode->val)
-                maxNode = cur;
+        Node *prev = head, *curr = head->next;
+        while (curr != head)
+        {
+            if ((prev->val <= insertVal && insertVal <= curr->val) || (prev->val > curr->val && (insertVal >= prev->val || insertVal <= curr->val))) break;
+            prev = curr;
+            curr = curr->next;
         }
-
-        if (cur->val <= insert->val && insert->val <= next->val) {
-            insert->next = next;
-            cur->next = insert;
-        } else {
-            insert->next = maxNode->next;
-            maxNode->next = insert;
-
-        }
-
+        prev->next = node;
+        node->next = curr;
+        return head;
     }
 };

lcof2/剑指 Offer II 029. 排序的循环链表/Solution.go

@@ -0,0 +1,25 @@
+/**
+ * Definition for a Node.
+ * type Node struct {
+ *     Val int
+ *     Next *Node
+ * }
+ */
+
+func insert(head *Node, x int) *Node {
+	node := &Node{Val: x}
+	if head == nil {
+		node.Next = node
+		return node
+	}
+	prev, curr := head, head.Next
+	for curr != head {
+		if (prev.Val <= x && x <= curr.Val) || (prev.Val > curr.Val && (x >= prev.Val || x <= curr.Val)) {
+			break
+		}
+		prev, curr = curr, curr.Next
+	}
+	prev.Next = node
+	node.Next = curr
+	return head
+}

solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README.md

@@ -70,21 +70,20 @@ class Node:
         self.next = next
 """
 
+
 class Solution:
-    def insert(self, head: 'Node', insertVal: int) -> 'Node':
-        node = Node(val=insertVal)
+    def insert(self, head: 'Optional[Node]', insertVal: int) -> 'Node':
+        node = Node(insertVal)
         if head is None:
             node.next = node
             return node
-        pre, cur = head, head.next
-        while 1:
-            if pre.val <= insertVal <= cur.val or (pre.val > cur.val and (insertVal >= pre.val or insertVal <= cur.val)):
-                break
-            pre, cur = cur, cur.next
-            if pre == head:
+        prev, curr = head, head.next
+        while curr != head:
+            if prev.val <= insertVal <= curr.val or (prev.val > curr.val and (insertVal >= prev.val or insertVal <= curr.val)):
                 break
-        pre.next = node
-        node.next = cur
+            prev, curr = curr, curr.next
+        prev.next = node
+        node.next = curr
         return head
 ```
 
@@ -119,19 +118,16 @@ class Solution {
             node.next = node;
             return node;
         }
-        Node pre = head, cur = head.next;
-        while (true) {
-            if ((pre.val <= insertVal && insertVal <= cur.val) || (pre.val > cur.val && (insertVal >= pre.val || cur.val >= insertVal))) {
-                break;
-            }
-            pre = cur;
-            cur = cur.next;
-            if (pre == head) {
+        Node prev = head, curr = head.next;
+        while (curr != head) {
+            if ((prev.val <= insertVal && insertVal <= curr.val) || (prev.val > curr.val && (insertVal >= prev.val || insertVal <= curr.val))) {
                 break;
             }
+            prev = curr;
+            curr = curr.next;
         }
-        pre.next = node;
-        node.next = cur;
+        prev.next = node;
+        node.next = curr;
         return head;
     }
 }
@@ -164,46 +160,56 @@ public:
 class Solution {
 public:
     Node* insert(Node* head, int insertVal) {
-        Node* insert = new Node(insertVal);
-        if (head == nullptr) {
-            head = insert;
-            head->next = head;
-        } else if (head->next == nullptr) {
-            head->next = insert;
-            insert->next = head;
-        } else {
-            insertCore(head, insert);
-        }
-
-        return head;
-    }
-
-    void insertCore(Node* head, Node* insert) {
-        Node* cur = head;
-        Node* maxNode = head;
-        Node* next = head->next;
-
-        while (!(cur->val <= insert->val && insert->val <= next->val) && next != head) {
-            cur = cur->next;
-            next = next->next;
-
-            if (cur->val >= maxNode->val)
-                maxNode = cur;
+        Node* node = new Node(insertVal);
+        if (!head)
+        {
+            node->next = node;
+            return node;
         }
-
-        if (cur->val <= insert->val && insert->val <= next->val) {
-            insert->next = next;
-            cur->next = insert;
-        } else {
-            insert->next = maxNode->next;
-            maxNode->next = insert;
-
+        Node *prev = head, *curr = head->next;
+        while (curr != head)
+        {
+            if ((prev->val <= insertVal && insertVal <= curr->val) || (prev->val > curr->val && (insertVal >= prev->val || insertVal <= curr->val))) break;
+            prev = curr;
+            curr = curr->next;
         }
-
+        prev->next = node;
+        node->next = curr;
+        return head;
     }
 };
 ```
 
+### **Go**
+
+```go
+/**
+ * Definition for a Node.
+ * type Node struct {
+ *     Val int
+ *     Next *Node
+ * }
+ */
+
+func insert(head *Node, x int) *Node {
+	node := &Node{Val: x}
+	if head == nil {
+		node.Next = node
+		return node
+	}
+	prev, curr := head, head.Next
+	for curr != head {
+		if (prev.Val <= x && x <= curr.Val) || (prev.Val > curr.Val && (x >= prev.Val || x <= curr.Val)) {
+			break
+		}
+		prev, curr = curr, curr.Next
+	}
+	prev.Next = node
+	node.Next = curr
+	return head
+}
+```
+
 ### **...**
 
 ```