feat: add solutions to lc problem: No.2589 (#927)

Author: thinkasany

solution/2500-2599/2589.Minimum Time to Complete All Tasks/README.md

@@ -163,6 +163,28 @@ func findMinimumTime(tasks [][]int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findMinimumTime(tasks: number[][]): number {
+    tasks.sort((a, b) => a[1] - b[1]);
+    const vis = new Array(2010).fill(0);
+    let ans = 0;
+    for (let [start, end, duration] of tasks) {
+        for (let i = start; i <= end; ++i) {
+            duration -= vis[i];
+        }
+        for (let i = end; i >= start && duration > 0; --i) {
+            if (vis[i] === 0) {
+                --duration;
+                ans += vis[i] = 1;
+            }
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2589.Minimum Time to Complete All Tasks/README_EN.md

@@ -143,6 +143,28 @@ func findMinimumTime(tasks [][]int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findMinimumTime(tasks: number[][]): number {
+    tasks.sort((a, b) => a[1] - b[1]);
+    const vis = new Array(2010).fill(0);
+    let ans = 0;
+    for (let [start, end, duration] of tasks) {
+        for (let i = start; i <= end; ++i) {
+            duration -= vis[i];
+        }
+        for (let i = end; i >= start && duration > 0; --i) {
+            if (vis[i] === 0) {
+                --duration;
+                ans += vis[i] = 1;
+            }
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2589.Minimum Time to Complete All Tasks/Solution.ts

@@ -0,0 +1,17 @@
+function findMinimumTime(tasks: number[][]): number {
+    tasks.sort((a, b) => a[1] - b[1]);
+    const vis = new Array(2010).fill(0);
+    let ans = 0;
+    for (let [start, end, duration] of tasks) {
+        for (let i = start; i <= end; ++i) {
+            duration -= vis[i];
+        }
+        for (let i = end; i >= start && duration > 0; --i) {
+            if (vis[i] === 0) {
+                --duration;
+                ans += vis[i] = 1;
+            }
+        }
+    }
+    return ans;
+}