feat: add solutions to lc problem: No.0708. Insert into a Sorted Circular Linked List

Author: yanglbme

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

@@ -52,7 +52,6 @@
 	<li><code>-10^6 <= insertVal <= 10^6</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -64,15 +63,79 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, next=None):
+        self.val = val
+        self.next = next
+"""
+
+class Solution:
+    def insert(self, head: 'Node', insertVal: int) -> 'Node':
+        node = Node(val=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:
+                break
+        pre.next = node
+        node.next = cur
+        return head
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+/*
+// 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) {
+        Node node = new Node(insertVal);
+        if (head == null) {
+            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) {
+                break;
+            }
+        }
+        pre.next = node;
+        node.next = cur;
+        return head;
+    }
+}
 ```
 
 ### **...**

Diff for: solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md

@@ -6,15 +6,10 @@
 
 <p>Given a node from a <strong>Circular Linked List</strong> which is sorted in ascending order,&nbsp;write a function to insert a value&nbsp;<code>insertVal</code> into the list such that it remains a&nbsp;sorted circular list. The given node can be a reference to <em>any</em> single node in the list, and may not be necessarily the smallest value in the circular&nbsp;list.</p>
 
-
-
 <p>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.</p>
 
-
-
 <p>If the list is empty (i.e., given node is <code>null</code>), you should create a new single circular list and return the reference to that single node. Otherwise, you should return the original given node.</p>
 
-
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
 <img alt="" src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/images/example_1_before_65p.jpg" style="width: 250px; height: 149px;" /><br />
@@ -52,21 +47,84 @@
 	<li><code>-10^6 &lt;=&nbsp;insertVal &lt;= 10^6</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, next=None):
+        self.val = val
+        self.next = next
+"""
+
+class Solution:
+    def insert(self, head: 'Node', insertVal: int) -> 'Node':
+        node = Node(val=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:
+                break
+        pre.next = node
+        node.next = cur
+        return head
 ```
 
 ### **Java**
 
 ```java
-
+/*
+// 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) {
+        Node node = new Node(insertVal);
+        if (head == null) {
+            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) {
+                break;
+            }
+        }
+        pre.next = node;
+        node.next = cur;
+        return head;
+    }
+}
 ```
 
 ### **...**

Diff for: solution/0700-0799/0708.Insert into a Sorted Circular Linked List/Solution.java

@@ -0,0 +1,42 @@
+/*
+// 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) {
+        Node node = new Node(insertVal);
+        if (head == null) {
+            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) {
+                break;
+            }
+        }
+        pre.next = node;
+        node.next = cur;
+        return head;
+    }
+}

Diff for: solution/0700-0799/0708.Insert into a Sorted Circular Linked List/Solution.py

@@ -0,0 +1,24 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, next=None):
+        self.val = val
+        self.next = next
+"""
+
+class Solution:
+    def insert(self, head: 'Node', insertVal: int) -> 'Node':
+        node = Node(val=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:
+                break
+        pre.next = node
+        node.next = cur
+        return head

Diff for: solution/1200-1299/1290.Convert Binary Number in a Linked List to Integer/README.md

@@ -59,7 +59,9 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-先求链表长度 n，再遍历链表，累加求得结果。
+遍历链表。
+
+当遍历到链表某个结点，先将已有结果 res 乘以 2（即左移 1 位：`<< 1`），再加上当前结点的值，得出已遍历过的结点的十进制值。最后返回 res 即可。
 
 <!-- tabs:start -->
 
@@ -122,13 +124,13 @@ class Solution {
  * @param {ListNode} head
  * @return {number}
  */
-var getDecimalValue = function(head) {
-    let res = 0;
-    while (head != null) {
-        res = (res << 1) + head.val;
-        head = head.next;
-    }
-    return res;
+var getDecimalValue = function (head) {
+  let res = 0;
+  while (head != null) {
+    res = (res << 1) + head.val;
+    head = head.next;
+  }
+  return res;
 };
 ```