feat: add typescript solution to lc problem: No.2289

No.2289.Steps to Make Array Non-decreasing

Author: zhaocchen

solution/2200-2299/2289.Steps to Make Array Non-decreasing/README.md

@@ -142,7 +142,21 @@ func max(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function totalSteps(nums: number[]): number {
+    let ans = 0;
+    let stack = [];
+    for (let num of nums) {
+        let max = 0;
+        while (stack.length && stack[0][0] <= num) {
+            max = Math.max(stack[0][1], max);
+            stack.shift();
+        }
+        if (stack.length) max++;
+        ans = Math.max(max, ans);
+        stack.unshift([num, max]);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2289.Steps to Make Array Non-decreasing/README_EN.md

@@ -130,7 +130,21 @@ func max(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function totalSteps(nums: number[]): number {
+    let ans = 0;
+    let stack = [];
+    for (let num of nums) {
+        let max = 0;
+        while (stack.length && stack[0][0] <= num) {
+            max = Math.max(stack[0][1], max);
+            stack.shift();
+        }
+        if (stack.length) max++;
+        ans = Math.max(max, ans);
+        stack.unshift([num, max]);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2289.Steps to Make Array Non-decreasing/Solution.ts

@@ -0,0 +1,15 @@
+function totalSteps(nums: number[]): number {
+    let ans = 0;
+    let stack = [];
+    for (let num of nums) {
+        let max = 0;
+        while (stack.length && stack[0][0] <= num) {
+            max = Math.max(stack[0][1], max);
+            stack.shift();
+        }
+        if (stack.length) max++;
+        ans = Math.max(max, ans);
+        stack.unshift([num, max]);
+    }
+    return ans;
+};