feat: add solutions to lc problem: No.0769

Author: rain84

solution/0700-0799/0769.Max Chunks To Make Sorted/README.md

@@ -290,6 +290,42 @@ func maxChunksToSorted(arr []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxChunksToSorted(arr: number[]): number {
+    const stk: number[] = [];
+
+    for (const x of arr) {
+        if (stk.at(-1)! > x) {
+            const top = stk.pop()!;
+            while (stk.length && stk.at(-1)! > x) stk.pop();
+            stk.push(top);
+        } else stk.push(x);
+    }
+
+    return stk.length;
+}
+```
+
+#### JavaScript
+
+```js
+function maxChunksToSorted(arr) {
+    const stk = [];
+
+    for (const x of arr) {
+        if (stk.at(-1) > x) {
+            const top = stk.pop();
+            while (stk.length && stk.at(-1) > x) stk.pop();
+            stk.push(top);
+        } else stk.push(x);
+    }
+
+    return stk.length;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0769.Max Chunks To Make Sorted/README_EN.md

@@ -275,6 +275,42 @@ func maxChunksToSorted(arr []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxChunksToSorted(arr: number[]): number {
+    const stk: number[] = [];
+
+    for (const x of arr) {
+        if (stk.at(-1)! > x) {
+            const top = stk.pop()!;
+            while (stk.length && stk.at(-1)! > x) stk.pop();
+            stk.push(top);
+        } else stk.push(x);
+    }
+
+    return stk.length;
+}
+```
+
+#### JavaScript
+
+```js
+function maxChunksToSorted(arr) {
+    const stk = [];
+
+    for (const x of arr) {
+        if (stk.at(-1) > x) {
+            const top = stk.pop();
+            while (stk.length && stk.at(-1) > x) stk.pop();
+            stk.push(top);
+        } else stk.push(x);
+    }
+
+    return stk.length;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0769.Max Chunks To Make Sorted/Solution2.js

@@ -0,0 +1,13 @@
+function maxChunksToSorted(arr) {
+    const stk = [];
+
+    for (const x of arr) {
+        if (stk.at(-1) > x) {
+            const top = stk.pop();
+            while (stk.length && stk.at(-1) > x) stk.pop();
+            stk.push(top);
+        } else stk.push(x);
+    }
+
+    return stk.length;
+}

solution/0700-0799/0769.Max Chunks To Make Sorted/Solution2.ts

@@ -0,0 +1,13 @@
+function maxChunksToSorted(arr: number[]): number {
+    const stk: number[] = [];
+
+    for (const x of arr) {
+        if (stk.at(-1)! > x) {
+            const top = stk.pop()!;
+            while (stk.length && stk.at(-1)! > x) stk.pop();
+            stk.push(top);
+        } else stk.push(x);
+    }
+
+    return stk.length;
+}