feat: update solutions for lc No.2531

Author: yanglbme

solution/2500-2599/2529.Maximum Count of Positive Integer and Negative Integer/README.md

@@ -276,20 +276,8 @@ func maximumCount(nums []int) int {
 
 ```ts
 function maximumCount(nums: number[]): number {
-    const search = (x: number): number => {
-        let [left, right] = [0, nums.length];
-        while (left < right) {
-            const mid = (left + right) >> 1;
-            if (nums[mid] >= x) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
-        }
-        return left;
-    };
-    const i = search(1);
-    const j = search(0);
+    const i = _.sortedLastIndex(nums, 0);
+    const j = _.sortedIndex(nums, 0);
     const [a, b] = [nums.length - i, j];
     return Math.max(a, b);
 }

solution/2500-2599/2529.Maximum Count of Positive Integer and Negative Integer/README_EN.md

@@ -273,20 +273,8 @@ func maximumCount(nums []int) int {
 
 ```ts
 function maximumCount(nums: number[]): number {
-    const search = (x: number): number => {
-        let [left, right] = [0, nums.length];
-        while (left < right) {
-            const mid = (left + right) >> 1;
-            if (nums[mid] >= x) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
-        }
-        return left;
-    };
-    const i = search(1);
-    const j = search(0);
+    const i = _.sortedLastIndex(nums, 0);
+    const j = _.sortedIndex(nums, 0);
     const [a, b] = [nums.length - i, j];
     return Math.max(a, b);
 }

solution/2500-2599/2529.Maximum Count of Positive Integer and Negative Integer/Solution2.java

@@ -1,9 +1,20 @@
 class Solution {
     public int maximumCount(int[] nums) {
-        int i = Arrays.binarySearch(nums, 1);
-        int a = i < 0 ? nums.length - (-i - 1) : nums.length - i;
-        int j = Arrays.binarySearch(nums, 0);
-        int b = j < 0 ? -j - 1 : j;
+        int a = nums.length - search(nums, 1);
+        int b = search(nums, 0);
         return Math.max(a, b);
     }
-}
+
+    private int search(int[] nums, int x) {
+        int left = 0, right = nums.length;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (nums[mid] >= x) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}

solution/2500-2599/2529.Maximum Count of Positive Integer and Negative Integer/Solution2.ts

@@ -1,18 +1,6 @@
 function maximumCount(nums: number[]): number {
-    const search = (x: number): number => {
-        let [left, right] = [0, nums.length];
-        while (left < right) {
-            const mid = (left + right) >> 1;
-            if (nums[mid] >= x) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
-        }
-        return left;
-    };
-    const i = search(1);
-    const j = search(0);
+    const i = _.sortedLastIndex(nums, 0);
+    const j = _.sortedIndex(nums, 0);
     const [a, b] = [nums.length - i, j];
     return Math.max(a, b);
 }