feat: update solutions to lc problems

* No.0497.Random Point in Non-overlapping Rectangles
* No.2294.Partition Array Such That Maximum Difference Is K

Author: yanglbme

solution/0400-0499/0497.Random Point in Non-overlapping Rectangles/README.md

@@ -64,9 +64,9 @@ solution.pick(); // 返回 [0, 0]</pre>
 
 <!-- 这里可写通用的实现逻辑 -->
 
-前缀和 + 二分查找。
+**方法一：前缀和 + 二分查找**
 
-将矩形面积求前缀和 s，然后随机获取到一个面积 v，利用二分查找定位到是哪个矩形，然后继续随机获取该矩形的其中一个整数点坐标即可。
+将矩形面积求前缀和 $s$，然后随机获取到一个面积 $v$，利用二分查找定位到是哪个矩形，然后继续随机获取该矩形的其中一个整数点坐标即可。
 
 <!-- tabs:start -->
 
@@ -85,14 +85,8 @@ class Solution:
 
     def pick(self) -> List[int]:
         v = random.randint(1, self.s[-1])
-        left, right = 0, len(self.s) - 1
-        while left < right:
-            mid = (left + right) >> 1
-            if self.s[mid] >= v:
-                right = mid
-            else:
-                left = mid + 1
-        x1, y1, x2, y2 = self.rects[left]
+        idx = bisect_left(self.s, v)
+        x1, y1, x2, y2 = self.rects[idx]
         return [random.randint(x1, x2), random.randint(y1, y2)]
 
 
@@ -159,18 +153,12 @@ public:
         this->rects = rects;
         srand(time(nullptr));
     }
-
+    
     vector<int> pick() {
         int n = rects.size();
         int v = 1 + rand() % s[n];
-        int left = 0, right = n;
-        while (left < right)
-        {
-            int mid = (left + right) >> 1;
-            if (s[mid] >= v) right = mid;
-            else left = mid + 1;
-        }
-        auto& rect = rects[left - 1];
+        int idx = lower_bound(s.begin(), s.end(), v) - s.begin();
+        auto& rect = rects[idx - 1];
         int x = rect[0] + rand() % (rect[2] - rect[0] + 1);
         int y = rect[1] + rand() % (rect[3] - rect[1] + 1);
         return {x, y};

solution/0400-0499/0497.Random Point in Non-overlapping Rectangles/README_EN.md

@@ -68,14 +68,8 @@ class Solution:
 
     def pick(self) -> List[int]:
         v = random.randint(1, self.s[-1])
-        left, right = 0, len(self.s) - 1
-        while left < right:
-            mid = (left + right) >> 1
-            if self.s[mid] >= v:
-                right = mid
-            else:
-                left = mid + 1
-        x1, y1, x2, y2 = self.rects[left]
+        idx = bisect_left(self.s, v)
+        x1, y1, x2, y2 = self.rects[idx]
         return [random.randint(x1, x2), random.randint(y1, y2)]
 
 
@@ -140,18 +134,12 @@ public:
         this->rects = rects;
         srand(time(nullptr));
     }
-
+    
     vector<int> pick() {
         int n = rects.size();
         int v = 1 + rand() % s[n];
-        int left = 0, right = n;
-        while (left < right)
-        {
-            int mid = (left + right) >> 1;
-            if (s[mid] >= v) right = mid;
-            else left = mid + 1;
-        }
-        auto& rect = rects[left - 1];
+        int idx = lower_bound(s.begin(), s.end(), v) - s.begin();
+        auto& rect = rects[idx - 1];
         int x = rect[0] + rand() % (rect[2] - rect[0] + 1);
         int y = rect[1] + rand() % (rect[3] - rect[1] + 1);
         return {x, y};

solution/0400-0499/0497.Random Point in Non-overlapping Rectangles/Solution.cpp

@@ -14,14 +14,8 @@ class Solution {
     vector<int> pick() {
         int n = rects.size();
         int v = 1 + rand() % s[n];
-        int left = 0, right = n;
-        while (left < right)
-        {
-            int mid = (left + right) >> 1;
-            if (s[mid] >= v) right = mid;
-            else left = mid + 1;
-        }
-        auto& rect = rects[left - 1];
+        int idx = lower_bound(s.begin(), s.end(), v) - s.begin();
+        auto& rect = rects[idx - 1];
         int x = rect[0] + rand() % (rect[2] - rect[0] + 1);
         int y = rect[1] + rand() % (rect[3] - rect[1] + 1);
         return {x, y};

solution/0400-0499/0497.Random Point in Non-overlapping Rectangles/Solution.py

@@ -1,4 +1,5 @@
 class Solution:
+
     def __init__(self, rects: List[List[int]]):
         self.rects = rects
         self.s = [0] * len(rects)
@@ -7,14 +8,8 @@ def __init__(self, rects: List[List[int]]):
 
     def pick(self) -> List[int]:
         v = random.randint(1, self.s[-1])
-        left, right = 0, len(self.s) - 1
-        while left < right:
-            mid = (left + right) >> 1
-            if self.s[mid] >= v:
-                right = mid
-            else:
-                left = mid + 1
-        x1, y1, x2, y2 = self.rects[left]
+        idx = bisect_left(self.s, v)
+        x1, y1, x2, y2 = self.rects[idx]
         return [random.randint(x1, x2), random.randint(y1, y2)]
 
 

solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md

@@ -158,7 +158,6 @@ func partitionArray(nums []int, k int) int {
 
 ```ts
 function partitionArray(nums: number[], k: number): number {
-    if (!nums.length) return 0;
     nums.sort((a, b) => a - b);
     let ans = 1;
     let prev = nums[0] + k;

solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md

@@ -146,7 +146,6 @@ func partitionArray(nums []int, k int) int {
 
 ```ts
 function partitionArray(nums: number[], k: number): number {
-    if (!nums.length) return 0;
     nums.sort((a, b) => a - b);
     let ans = 1;
     let prev = nums[0] + k;

solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.ts

@@ -1,5 +1,4 @@
 function partitionArray(nums: number[], k: number): number {
-    if (!nums.length) return 0;
     nums.sort((a, b) => a - b);
     let ans = 1;
     let prev = nums[0] + k;