feat: add solutions to lc problems

* No.2357.Make Array Zero by Subtracting Equal Amounts
* No.2359.Find Closest Node to Given Two Nodes
* No.2363.Merge Similar Items
* No.2364.Count Number of Bad Pair

Author: yanglbme

solution/0400-0499/0410.Split Array Largest Sum/README_EN.md

@@ -82,7 +82,7 @@ class Solution {
         }
         return left;
     }
-    
+
     private boolean check(int[] nums, int mx, int k) {
         int s = 1 << 30, cnt = 0;
         for (int x : nums) {

solution/1100-1199/1157.Online Majority Element In Subarray/README_EN.md

@@ -194,7 +194,7 @@ class SegmentTree {
         } else {
             tr[u].x = tr[u << 1 | 1].x;
             tr[u].cnt = tr[u << 1 | 1].cnt - tr[u << 1].cnt;
-        } 
+        }
     }
 }
 
@@ -208,7 +208,7 @@ class MajorityChecker {
             d.computeIfAbsent(arr[i], k -> new ArrayList<>()).add(i);
         }
     }
-    
+
     public int query(int left, int right, int threshold) {
         int x = tree.query(1, left + 1, right + 1)[0];
         int l = search(d.get(x), left);

solution/1100-1199/1157.Online Majority Element In Subarray/Solution.py

@@ -52,7 +52,6 @@ def pushup(self, u):
 
 
 class MajorityChecker:
-
     def __init__(self, arr: List[int]):
         self.tree = SegmentTree(arr)
         self.d = defaultdict(list)

solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README.md

@@ -94,7 +94,7 @@ class Solution:
                     return False
                 x //= 10
             return True
-        
+
         for a in range(1, n):
             b = n - a
             if f(a) and f(b):

solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README_EN.md

@@ -66,7 +66,7 @@ class Solution:
                     return False
                 x //= 10
             return True
-        
+
         for a in range(1, n):
             b = n - a
             if f(a) and f(b):

solution/1400-1499/1483.Kth Ancestor of a Tree Node/README_EN.md

@@ -99,7 +99,7 @@ class TreeAncestor {
             }
         }
     }
-    
+
     public int getKthAncestor(int node, int k) {
         for (int i = 17; i >= 0; --i) {
             if (((k >> i) & 1) == 1) {
@@ -139,7 +139,7 @@ public:
             }
         }
     }
-    
+
     int getKthAncestor(int node, int k) {
         for (int i = 17; ~i; --i) {
             if (k >> i & 1) {

solution/2300-2399/2357.Make Array Zero by Subtracting Equal Amounts/README.md

@@ -125,7 +125,18 @@ func minimumOperations(nums []int) (ans int) {
 ### **TypeScript**
 
 ```ts
-
+function minimumOperations(nums: number[]): number {
+    const s = new Array(101).fill(false);
+    s[0] = true;
+    let ans = 0;
+    for (const x of nums) {
+        if (!s[x]) {
+            s[x] = true;
+            ++ans;
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2300-2399/2357.Make Array Zero by Subtracting Equal Amounts/README_EN.md

@@ -110,7 +110,18 @@ func minimumOperations(nums []int) (ans int) {
 ### **TypeScript**
 
 ```ts
-
+function minimumOperations(nums: number[]): number {
+    const s = new Array(101).fill(false);
+    s[0] = true;
+    let ans = 0;
+    for (const x of nums) {
+        if (!s[x]) {
+            s[x] = true;
+            ++ans;
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2300-2399/2357.Make Array Zero by Subtracting Equal Amounts/Solution.ts

@@ -0,0 +1,12 @@
+function minimumOperations(nums: number[]): number {
+    const s = new Array(101).fill(false);
+    s[0] = true;
+    let ans = 0;
+    for (const x of nums) {
+        if (!s[x]) {
+            s[x] = true;
+            ++ans;
+        }
+    }
+    return ans;
+}

solution/2300-2399/2359.Find Closest Node to Given Two Nodes/README.md

@@ -437,7 +437,47 @@ func max(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function closestMeetingNode(
+    edges: number[],
+    node1: number,
+    node2: number,
+): number {
+    const n = edges.length;
+    const g = Array.from({ length: n }, () => []);
+    for (let i = 0; i < n; ++i) {
+        if (edges[i] != -1) {
+            g[i].push(edges[i]);
+        }
+    }
+    const inf = 1 << 30;
+    const f = (i: number) => {
+        const dist = new Array(n).fill(inf);
+        dist[i] = 0;
+        const q: number[] = [i];
+        while (q.length) {
+            i = q.shift();
+            for (const j of g[i]) {
+                if (dist[j] == inf) {
+                    dist[j] = dist[i] + 1;
+                    q.push(j);
+                }
+            }
+        }
+        return dist;
+    };
+    const d1 = f(node1);
+    const d2 = f(node2);
+    let ans = -1;
+    let d = inf;
+    for (let i = 0; i < n; ++i) {
+        const t = Math.max(d1[i], d2[i]);
+        if (t < d) {
+            d = t;
+            ans = i;
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**