feat: add solutions to lc problems: No.2574~2576 (doocs#900)

Author: thinkasany

solution/2500-2599/2574.Left and Right Sum Differences/README.md

@@ -143,6 +143,22 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function leftRigthDifference(nums: number[]): number[] {
+    let left = 0,
+        right = nums.reduce((a, b) => a + b);
+    const ans: number[] = [];
+    for (const x of nums) {
+        right -= x;
+        ans.push(Math.abs(left - right));
+        left += x;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2574.Left and Right Sum Differences/README_EN.md

@@ -125,6 +125,22 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function leftRigthDifference(nums: number[]): number[] {
+    let left = 0,
+        right = nums.reduce((a, b) => a + b);
+    const ans: number[] = [];
+    for (const x of nums) {
+        right -= x;
+        ans.push(Math.abs(left - right));
+        left += x;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2574.Left and Right Sum Differences/Solution.ts

@@ -0,0 +1,11 @@
+function leftRigthDifference(nums: number[]): number[] {
+    let left = 0,
+        right = nums.reduce((a, b) => a + b);
+    const ans: number[] = [];
+    for (const x of nums) {
+        right -= x;
+        ans.push(Math.abs(left - right));
+        left += x;
+    }
+    return ans;
+}

solution/2500-2599/2575.Find the Divisibility Array of a String/README.md

@@ -128,6 +128,20 @@ func divisibilityArray(word string, m int) (ans []int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function divisibilityArray(word: string, m: number): number[] {
+    const ans: number[] = [];
+    let x = 0;
+    for (const c of word) {
+        x = (x * 10 + Number(c)) % m;
+        ans.push(x === 0 ? 1 : 0);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2575.Find the Divisibility Array of a String/README_EN.md

@@ -112,6 +112,20 @@ func divisibilityArray(word string, m int) (ans []int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function divisibilityArray(word: string, m: number): number[] {
+    const ans: number[] = [];
+    let x = 0;
+    for (const c of word) {
+        x = (x * 10 + Number(c)) % m;
+        ans.push(x === 0 ? 1 : 0);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2575.Find the Divisibility Array of a String/Solution.ts

@@ -0,0 +1,9 @@
+function divisibilityArray(word: string, m: number): number[] {
+    const ans: number[] = [];
+    let x = 0;
+    for (const c of word) {
+        x = (x * 10 + Number(c)) % m;
+        ans.push(x === 0 ? 1 : 0);
+    }
+    return ans;
+}

solution/2500-2599/2576.Find the Maximum Number of Marked Indices/README.md

@@ -149,6 +149,25 @@ func maxNumOfMarkedIndices(nums []int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxNumOfMarkedIndices(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0, j = Math.floor((n + 1) / 2); j < n; ++i, ++j) {
+        while (j < n && nums[i] * 2 > nums[j]) {
+            ++j;
+        }
+        if (j < n) {
+            ans += 2;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2576.Find the Maximum Number of Marked Indices/README_EN.md

@@ -143,6 +143,25 @@ func maxNumOfMarkedIndices(nums []int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxNumOfMarkedIndices(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0, j = Math.floor((n + 1) / 2); j < n; ++i, ++j) {
+        while (j < n && nums[i] * 2 > nums[j]) {
+            ++j;
+        }
+        if (j < n) {
+            ans += 2;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2576.Find the Maximum Number of Marked Indices/Solution.ts

@@ -0,0 +1,14 @@
+function maxNumOfMarkedIndices(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0, j = Math.floor((n + 1) / 2); j < n; ++i, ++j) {
+        while (j < n && nums[i] * 2 > nums[j]) {
+            ++j;
+        }
+        if (j < n) {
+            ans += 2;
+        }
+    }
+    return ans;
+}