feat: update solutions to lc problems

yanglbme · yanglbme · commit 898db4820ac6 · 2022-05-03T10:02:59.000+08:00
* No.0067.Add Binary
* No.0445.Add Two Numbers II
* No.0591.Tag Validator
diff --git a/solution/0000-0099/0067.Add Binary/README.md b/solution/0000-0099/0067.Add Binary/README.md
@@ -48,6 +48,19 @@ class Solution:
         return bin(int(a, 2) + int(b, 2))[2:]
 ```
 
+```python
+class Solution:
+    def addBinary(self, a: str, b: str) -> str:
+        ans = []
+        i, j, carry = len(a) - 1, len(b) - 1, 0
+        while i >= 0 or j >= 0 or carry:
+            carry += (0 if i < 0 else int(a[i])) + (0 if j < 0 else int(b[j]))
+            carry, v = divmod(carry, 2)
+            ans.append(str(v))
+            i, j = i - 1, j - 1
+        return ''.join(ans[::-1])
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
@@ -56,13 +69,10 @@ class Solution:
 class Solution {
     public String addBinary(String a, String b) {
         StringBuilder sb = new StringBuilder();
-        int i = a.length() - 1, j = b.length() - 1, carry = 0;
-        while (i >= 0 || j >= 0 || carry != 0) {
-            int s = carry + (i >= 0 ? a.charAt(i) - '0' : 0) + (j >= 0 ? b.charAt(j) - '0' : 0);
-            sb.append(s % 2);
-            carry = s / 2;
-            --i;
-            --j;
+        for (int i = a.length() - 1, j = b.length() - 1, carry = 0; i >= 0 || j >= 0 || carry > 0; --i, --j) {
+            carry += (i >= 0 ? a.charAt(i) - '0' : 0) + (j >= 0 ? b.charAt(j) - '0' : 0);
+            sb.append(carry % 2);
+            carry /= 2;
         }
         return sb.reverse().toString();
     }
diff --git a/solution/0000-0099/0067.Add Binary/README_EN.md b/solution/0000-0099/0067.Add Binary/README_EN.md
@@ -35,19 +35,29 @@ class Solution:
         return bin(int(a, 2) + int(b, 2))[2:]
 ```
 
+```python
+class Solution:
+    def addBinary(self, a: str, b: str) -> str:
+        ans = []
+        i, j, carry = len(a) - 1, len(b) - 1, 0
+        while i >= 0 or j >= 0 or carry:
+            carry += (0 if i < 0 else int(a[i])) + (0 if j < 0 else int(b[j]))
+            carry, v = divmod(carry, 2)
+            ans.append(str(v))
+            i, j = i - 1, j - 1
+        return ''.join(ans[::-1])
+```
+
 ### **Java**
 
 ```java
 class Solution {
     public String addBinary(String a, String b) {
         StringBuilder sb = new StringBuilder();
-        int i = a.length() - 1, j = b.length() - 1, carry = 0;
-        while (i >= 0 || j >= 0 || carry != 0) {
-            int s = carry + (i >= 0 ? a.charAt(i) - '0' : 0) + (j >= 0 ? b.charAt(j) - '0' : 0);
-            sb.append(s % 2);
-            carry = s / 2;
-            --i;
-            --j;
+        for (int i = a.length() - 1, j = b.length() - 1, carry = 0; i >= 0 || j >= 0 || carry > 0; --i, --j) {
+            carry += (i >= 0 ? a.charAt(i) - '0' : 0) + (j >= 0 ? b.charAt(j) - '0' : 0);
+            sb.append(carry % 2);
+            carry /= 2;
         }
         return sb.reverse().toString();
     }
diff --git a/solution/0000-0099/0067.Add Binary/Solution.java b/solution/0000-0099/0067.Add Binary/Solution.java
@@ -1,13 +1,10 @@
 class Solution {
     public String addBinary(String a, String b) {
         StringBuilder sb = new StringBuilder();
-        int i = a.length() - 1, j = b.length() - 1, carry = 0;
-        while (i >= 0 || j >= 0 || carry != 0) {
-            int s = carry + (i >= 0 ? a.charAt(i) - '0' : 0) + (j >= 0 ? b.charAt(j) - '0' : 0);
-            sb.append(s % 2);
-            carry = s / 2;
-            --i;
-            --j;
+        for (int i = a.length() - 1, j = b.length() - 1, carry = 0; i >= 0 || j >= 0 || carry > 0; --i, --j) {
+            carry += (i >= 0 ? a.charAt(i) - '0' : 0) + (j >= 0 ? b.charAt(j) - '0' : 0);
+            sb.append(carry % 2);
+            carry /= 2;
         }
         return sb.reverse().toString();
     }
diff --git a/solution/0400-0499/0445.Add Two Numbers II/README.md b/solution/0400-0499/0445.Add Two Numbers II/README.md
@@ -53,7 +53,9 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-利用栈将数字逆序。
+**方法一：栈**
+
+利用两个栈分别存储两个链表元素。然后对两个栈中对应元素相加，并记录进位 carry。
 
 <!-- tabs:start -->
 
@@ -79,10 +81,9 @@ class Solution:
         carry, dummy = 0, ListNode()
         while s1 or s2 or carry:
             carry += (0 if not s1 else s1.pop()) + (0 if not s2 else s2.pop())
-            # 创建结点，利用头插法将结点插入链表
-            node = ListNode(carry % 10, dummy.next)
+            carry, val = divmod(carry, 10)
+            node = ListNode(val, dummy.next)
             dummy.next = node
-            carry //= 10
         return dummy.next
 ```
 
@@ -102,6 +103,7 @@ class Solution:
  * }
  */
 class Solution {
+
     public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
         Deque<Integer> s1 = new ArrayDeque<>();
         Deque<Integer> s2 = new ArrayDeque<>();
@@ -114,14 +116,16 @@ class Solution {
         int carry = 0;
         ListNode dummy = new ListNode();
         while (!s1.isEmpty() || !s2.isEmpty() || carry != 0) {
-            carry += (s1.isEmpty() ? 0 : s1.pop()) + (s2.isEmpty() ? 0 : s2.pop());
+            carry +=
+                (s1.isEmpty() ? 0 : s1.pop()) + (s2.isEmpty() ? 0 : s2.pop());
             ListNode node = new ListNode(carry % 10, dummy.next);
             dummy.next = node;
             carry /= 10;
         }
         return dummy.next;
     }
 }
+
 ```
 
 ### **C++**
diff --git a/solution/0400-0499/0445.Add Two Numbers II/README_EN.md b/solution/0400-0499/0445.Add Two Numbers II/README_EN.md
@@ -66,9 +66,9 @@ class Solution:
         carry, dummy = 0, ListNode()
         while s1 or s2 or carry:
             carry += (0 if not s1 else s1.pop()) + (0 if not s2 else s2.pop())
-            node = ListNode(carry % 10, dummy.next)
+            carry, val = divmod(carry, 10)
+            node = ListNode(val, dummy.next)
             dummy.next = node
-            carry //= 10
         return dummy.next
 ```
 
diff --git a/solution/0400-0499/0445.Add Two Numbers II/Solution.py b/solution/0400-0499/0445.Add Two Numbers II/Solution.py
@@ -15,7 +15,7 @@ def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
         carry, dummy = 0, ListNode()
         while s1 or s2 or carry:
             carry += (0 if not s1 else s1.pop()) + (0 if not s2 else s2.pop())
-            node = ListNode(carry % 10, dummy.next)
+            carry, val = divmod(carry, 10)
+            node = ListNode(val, dummy.next)
             dummy.next = node
-            carry //= 10
         return dummy.next
diff --git a/solution/0500-0599/0591.Tag Validator/README.md b/solution/0500-0599/0591.Tag Validator/README.md
@@ -107,33 +107,32 @@ cdata <strong>不</strong>是 <strong>&quot;&lt;![CDATA[&lt;div&gt;]&gt;]]&gt;]]
 class Solution:
     def isValid(self, code: str) -> bool:
         def check(tag):
-            n = len(tag)
-            return 1 <= n <= 9 and all(c.isupper() for c in tag)
+            return 1 <= len(tag) <= 9 and all(c.isupper() for c in tag)
 
         stk = []
         i, n = 0, len(code)
         while i < n:
             if i and not stk:
                 return False
-            if code[i: i + 9] == '<![CDATA[':
+            if code[i : i + 9] == '<![CDATA[':
                 i = code.find(']]>', i + 9)
                 if i < 0:
                     return False
                 i += 2
-            elif code[i: i + 2] == '</':
+            elif code[i : i + 2] == '</':
                 j = i + 2
                 i = code.find('>', j)
                 if i < 0:
                     return False
-                t = code[j: i]
+                t = code[j:i]
                 if not check(t) or not stk or stk.pop() != t:
                     return False
             elif code[i] == '<':
                 j = i + 1
                 i = code.find('>', j)
                 if i < 0:
                     return False
-                t = code[j: i]
+                t = code[j:i]
                 if not check(t):
                     return False
                 stk.append(t)
diff --git a/solution/0500-0599/0591.Tag Validator/README_EN.md b/solution/0500-0599/0591.Tag Validator/README_EN.md
@@ -75,33 +75,32 @@ The reason why cdata is NOT <b>&quot;&lt;![CDATA[&lt;div&gt;]&gt;]]&gt;]]&gt;&qu
 class Solution:
     def isValid(self, code: str) -> bool:
         def check(tag):
-            n = len(tag)
-            return 1 <= n <= 9 and all(c.isupper() for c in tag)
+            return 1 <= len(tag) <= 9 and all(c.isupper() for c in tag)
 
         stk = []
         i, n = 0, len(code)
         while i < n:
             if i and not stk:
                 return False
-            if code[i: i + 9] == '<![CDATA[':
+            if code[i : i + 9] == '<![CDATA[':
                 i = code.find(']]>', i + 9)
                 if i < 0:
                     return False
                 i += 2
-            elif code[i: i + 2] == '</':
+            elif code[i : i + 2] == '</':
                 j = i + 2
                 i = code.find('>', j)
                 if i < 0:
                     return False
-                t = code[j: i]
+                t = code[j:i]
                 if not check(t) or not stk or stk.pop() != t:
                     return False
             elif code[i] == '<':
                 j = i + 1
                 i = code.find('>', j)
                 if i < 0:
                     return False
-                t = code[j: i]
+                t = code[j:i]
                 if not check(t):
                     return False
                 stk.append(t)
diff --git a/solution/0500-0599/0591.Tag Validator/Solution.py b/solution/0500-0599/0591.Tag Validator/Solution.py
@@ -1,8 +1,7 @@
 class Solution:
     def isValid(self, code: str) -> bool:
         def check(tag):
-            n = len(tag)
-            return 1 <= n <= 9 and all(c.isupper() for c in tag)
+            return 1 <= len(tag) <= 9 and all(c.isupper() for c in tag)
 
         stk = []
         i, n = 0, len(code)
