feat: update solutions to lc problem: No.0374 (doocs#2985)

Author: yanglbme

lcof2/剑指 Offer II 002. 二进制加法/README.md

@@ -62,7 +62,14 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcof2/%E5%89%91%E6%8C%87%2
 ```python
 class Solution:
     def addBinary(self, a: str, b: str) -> str:
-        return bin(int(a, 2) + int(b, 2))[2:]
+        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
@@ -128,7 +135,16 @@ func addBinary(a string, b string) string {
 
 ```ts
 function addBinary(a: string, b: string): string {
-    return (BigInt('0b' + a) + BigInt('0b' + b)).toString(2);
+    let i = a.length - 1;
+    let j = b.length - 1;
+    let ans: number[] = [];
+    for (let carry = 0; i >= 0 || j >= 0 || carry; --i, --j) {
+        carry += (i >= 0 ? a[i] : '0').charCodeAt(0) - '0'.charCodeAt(0);
+        carry += (j >= 0 ? b[j] : '0').charCodeAt(0) - '0'.charCodeAt(0);
+        ans.push(carry % 2);
+        carry >>= 1;
+    }
+    return ans.reverse().join('');
 }
 ```
 

lcof2/剑指 Offer II 002. 二进制加法/Solution.py

@@ -1,3 +1,10 @@
 class Solution:
     def addBinary(self, a: str, b: str) -> str:
-        return bin(int(a, 2) + int(b, 2))[2:]
+        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])

lcof2/剑指 Offer II 002. 二进制加法/Solution2.py

@@ -75,7 +75,7 @@ tags:
 
 我们在区间 $[1,..n]$ 进行二分查找，找到第一个满足 `guess(x) <= 0` 的数，即为答案。
 
-时间复杂度 $O(\log n)$。其中 $n$ 为题目给定的上限。
+时间复杂度 $O(\log n)$。其中 $n$ 为题目给定的上限。空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
 
@@ -84,20 +84,15 @@ tags:
 ```python
 # The guess API is already defined for you.
 # @param num, your guess
-# @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
+# @return -1 if num is higher than the picked number
+#          1 if num is lower than the picked number
+#          otherwise return 0
 # def guess(num: int) -> int:
 
 
 class Solution:
     def guessNumber(self, n: int) -> int:
-        left, right = 1, n
-        while left < right:
-            mid = (left + right) >> 1
-            if guess(mid) <= 0:
-                right = mid
-            else:
-                left = mid + 1
-        return left
+        return bisect.bisect(range(1, n + 1), 0, key=lambda x: -guess(x))
 ```
 
 #### Java
@@ -163,23 +158,17 @@ public:
 /**
  * Forward declaration of guess API.
  * @param  num   your guess
- * @return 	     -1 if num is lower than the guess number
- *			      1 if num is higher than the guess number
+ * @return 	     -1 if num is higher than the picked number
+ *			      1 if num is lower than the picked number
  *               otherwise return 0
  * func guess(num int) int;
  */
 
 func guessNumber(n int) int {
-	left, right := 1, n
-	for left < right {
-		mid := (left + right) >> 1
-		if guess(mid) <= 0 {
-			right = mid
-		} else {
-			left = mid + 1
-		}
-	}
-	return left
+	return sort.Search(n, func(i int) bool {
+		i++
+		return guess(i) <= 0
+	}) + 1
 }
 ```
 
@@ -277,50 +266,4 @@ public class Solution : GuessGame {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### 方法二
-
-<!-- tabs:start -->
-
-#### Python3
-
-```python
-# The guess API is already defined for you.
-# @param num, your guess
-# @return -1 if num is higher than the picked number
-#          1 if num is lower than the picked number
-#          otherwise return 0
-# def guess(num: int) -> int:
-
-
-class Solution:
-    def guessNumber(self, n: int) -> int:
-        return bisect.bisect(range(1, n + 1), 0, key=lambda x: -guess(x))
-```
-
-#### Go
-
-```go
-/**
- * Forward declaration of guess API.
- * @param  num   your guess
- * @return 	     -1 if num is higher than the picked number
- *			      1 if num is lower than the picked number
- *               otherwise return 0
- * func guess(num int) int;
- */
-
-func guessNumber(n int) int {
-	return sort.Search(n, func(i int) bool {
-		i++
-		return guess(i) <= 0
-	}) + 1
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->

lcof2/剑指 Offer II 002. 二进制加法/Solution2.ts

@@ -69,7 +69,11 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Binary Search
+
+We perform a binary search in the interval $[1,..n]$, and find the first number that satisfies `guess(x) <= 0`, which is the answer.
+
+The time complexity is $O(\log n)$, where $n$ is the upper limit given in the problem. The space complexity is $O(1)$.
 
 <!-- tabs:start -->
 
@@ -78,20 +82,15 @@ tags:
 ```python
 # The guess API is already defined for you.
 # @param num, your guess
-# @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
+# @return -1 if num is higher than the picked number
+#          1 if num is lower than the picked number
+#          otherwise return 0
 # def guess(num: int) -> int:
 
 
 class Solution:
     def guessNumber(self, n: int) -> int:
-        left, right = 1, n
-        while left < right:
-            mid = (left + right) >> 1
-            if guess(mid) <= 0:
-                right = mid
-            else:
-                left = mid + 1
-        return left
+        return bisect.bisect(range(1, n + 1), 0, key=lambda x: -guess(x))
 ```
 
 #### Java
@@ -157,23 +156,17 @@ public:
 /**
  * Forward declaration of guess API.
  * @param  num   your guess
- * @return 	     -1 if num is lower than the guess number
- *			      1 if num is higher than the guess number
+ * @return 	     -1 if num is higher than the picked number
+ *			      1 if num is lower than the picked number
  *               otherwise return 0
  * func guess(num int) int;
  */
 
 func guessNumber(n int) int {
-	left, right := 1, n
-	for left < right {
-		mid := (left + right) >> 1
-		if guess(mid) <= 0 {
-			right = mid
-		} else {
-			left = mid + 1
-		}
-	}
-	return left
+	return sort.Search(n, func(i int) bool {
+		i++
+		return guess(i) <= 0
+	}) + 1
 }
 ```
 
@@ -270,50 +263,4 @@ public class Solution : GuessGame {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### Solution 2
-
-<!-- tabs:start -->
-
-#### Python3
-
-```python
-# The guess API is already defined for you.
-# @param num, your guess
-# @return -1 if num is higher than the picked number
-#          1 if num is lower than the picked number
-#          otherwise return 0
-# def guess(num: int) -> int:
-
-
-class Solution:
-    def guessNumber(self, n: int) -> int:
-        return bisect.bisect(range(1, n + 1), 0, key=lambda x: -guess(x))
-```
-
-#### Go
-
-```go
-/**
- * Forward declaration of guess API.
- * @param  num   your guess
- * @return 	     -1 if num is higher than the picked number
- *			      1 if num is lower than the picked number
- *               otherwise return 0
- * func guess(num int) int;
- */
-
-func guessNumber(n int) int {
-	return sort.Search(n, func(i int) bool {
-		i++
-		return guess(i) <= 0
-	}) + 1
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->

solution/0300-0399/0374.Guess Number Higher or Lower/README.md

@@ -1,21 +1,15 @@
 /**
  * Forward declaration of guess API.
  * @param  num   your guess
- * @return 	     -1 if num is lower than the guess number
- *			      1 if num is higher than the guess number
+ * @return 	     -1 if num is higher than the picked number
+ *			      1 if num is lower than the picked number
  *               otherwise return 0
  * func guess(num int) int;
  */
 
 func guessNumber(n int) int {
-	left, right := 1, n
-	for left < right {
-		mid := (left + right) >> 1
-		if guess(mid) <= 0 {
-			right = mid
-		} else {
-			left = mid + 1
-		}
-	}
-	return left
+	return sort.Search(n, func(i int) bool {
+		i++
+		return guess(i) <= 0
+	}) + 1
 }

solution/0300-0399/0374.Guess Number Higher or Lower/README_EN.md

@@ -1,16 +1,11 @@
 # The guess API is already defined for you.
 # @param num, your guess
-# @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
+# @return -1 if num is higher than the picked number
+#          1 if num is lower than the picked number
+#          otherwise return 0
 # def guess(num: int) -> int:
 
 
 class Solution:
     def guessNumber(self, n: int) -> int:
-        left, right = 1, n
-        while left < right:
-            mid = (left + right) >> 1
-            if guess(mid) <= 0:
-                right = mid
-            else:
-                left = mid + 1
-        return left
+        return bisect.bisect(range(1, n + 1), 0, key=lambda x: -guess(x))