feat: add ts solutions to lc problem: No.2154-2155

2154.Keep Multiplying Found Values by Two
2155.All Divisions With the Highest Score of a Binary Array

Author: zhaocchen

solution/2100-2199/2154.Keep Multiplying Found Values by Two/README.md

@@ -75,7 +75,13 @@
 ### **TypeScript**
 
 ```ts
-
+function findFinalValue(nums: number[], original: number): number {
+    let set: Set<number> = new Set(nums);
+    while (set.has(original)) {
+        original *= 2;
+    }
+    return original;
+};
 ```
 
 ### **...**

solution/2100-2199/2154.Keep Multiplying Found Values by Two/README_EN.md

@@ -65,7 +65,13 @@
 ### **TypeScript**
 
 ```ts
-
+function findFinalValue(nums: number[], original: number): number {
+    let set: Set<number> = new Set(nums);
+    while (set.has(original)) {
+        original *= 2;
+    }
+    return original;
+};
 ```
 
 ### **...**

solution/2100-2199/2154.Keep Multiplying Found Values by Two/Solution.ts

@@ -0,0 +1,7 @@
+function findFinalValue(nums: number[], original: number): number {
+    let set: Set<number> = new Set(nums);
+    while (set.has(original)) {
+        original *= 2;
+    }
+    return original;
+};

solution/2100-2199/2155.All Divisions With the Highest Score of a Binary Array/README.md

@@ -91,7 +91,28 @@
 ### **TypeScript**
 
 ```ts
-
+function maxScoreIndices(nums: number[]): number[] {
+    const n = nums.length;
+    const total = nums.reduce((a, c) => a + c, 0);
+    let left = 0, right = total;
+    let record: Array<number> = [total];
+    for (const num of nums) {
+        if (num == 0) {
+            left++;
+        } else {
+            right--;
+        }
+        record.push(left + right);
+    }
+    const max = Math.max(...record);
+    let ans: Array<number> = [];
+    for (let i = 0; i <= n; i++) {
+        if (record[i] == max) {
+            ans.push(i);
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2100-2199/2155.All Divisions With the Highest Score of a Binary Array/README_EN.md

@@ -84,7 +84,28 @@ Only index 0 has the highest possible division score 2.
 ### **TypeScript**
 
 ```ts
-
+function maxScoreIndices(nums: number[]): number[] {
+    const n = nums.length;
+    const total = nums.reduce((a, c) => a + c, 0);
+    let left = 0, right = total;
+    let record: Array<number> = [total];
+    for (const num of nums) {
+        if (num == 0) {
+            left++;
+        } else {
+            right--;
+        }
+        record.push(left + right);
+    }
+    const max = Math.max(...record);
+    let ans: Array<number> = [];
+    for (let i = 0; i <= n; i++) {
+        if (record[i] == max) {
+            ans.push(i);
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2100-2199/2155.All Divisions With the Highest Score of a Binary Array/Solution.ts

@@ -0,0 +1,22 @@
+function maxScoreIndices(nums: number[]): number[] {
+    const n = nums.length;
+    const total = nums.reduce((a, c) => a + c, 0);
+    let left = 0, right = total;
+    let record: Array<number> = [total];
+    for (const num of nums) {
+        if (num == 0) {
+            left++;
+        } else {
+            right--;
+        }
+        record.push(left + right);
+    }
+    const max = Math.max(...record);
+    let ans: Array<number> = [];
+    for (let i = 0; i <= n; i++) {
+        if (record[i] == max) {
+            ans.push(i);
+        }
+    }
+    return ans;
+};