feat: add typescript solution to lc problem: No.0768、0769

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

@@ -44,6 +44,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+单调栈
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -62,6 +64,26 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function maxChunksToSorted(arr: number[]): number {
+    let stack = []; // 左进左出
+    for (let num of arr) {
+        if (stack.length && num < stack[0]) {
+            let max = stack.shift();
+            while (stack.length && num < stack[0]) {
+                stack.shift();
+            }
+            stack.unshift(max);
+        } else {
+            stack.unshift(num);
+        }
+    }
+    return stack.length;
+};
+```
+
 ### **...**
 
 ```

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

@@ -91,6 +91,26 @@ However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks po
 
 ```
 
+### **TypeScript**
+
+```ts
+function maxChunksToSorted(arr: number[]): number {
+    let stack = []; // 左进左出
+    for (let num of arr) {
+        if (stack.length && num < stack[0]) {
+            let max = stack.shift();
+            while (stack.length && num < stack[0]) {
+                stack.shift();
+            }
+            stack.unshift(max);
+        } else {
+            stack.unshift(num);
+        }
+    }
+    return stack.length;
+};
+```
+
 ### **...**
 
 ```

solution/0700-0799/0768.Max Chunks To Make Sorted II/Solution.ts

@@ -0,0 +1,15 @@
+function maxChunksToSorted(arr: number[]): number {
+    let stack = []; // 左进左出
+    for (let num of arr) {
+        if (stack.length && num < stack[0]) {
+            let max = stack.shift();
+            while (stack.length && num < stack[0]) {
+                stack.shift();
+            }
+            stack.unshift(max);
+        } else {
+            stack.unshift(num);
+        }
+    }
+    return stack.length;
+};

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

@@ -58,6 +58,24 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function maxChunksToSorted(arr: number[]): number {
+    const n = arr.length;
+    let ans = 0;
+    let max = 0;
+    for (let i = 0; i < n; i++) {
+        let cur = arr[i];
+        max = Math.max(cur, max);
+        if (max == i) {
+            ans++;
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

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

@@ -84,6 +84,24 @@ However, splitting into [1, 0], [2], [3], [4] is the highest number of chunks po
 
 ```
 
+### **TypeScript**
+
+```ts
+function maxChunksToSorted(arr: number[]): number {
+    const n = arr.length;
+    let ans = 0;
+    let max = 0;
+    for (let i = 0; i < n; i++) {
+        let cur = arr[i];
+        max = Math.max(cur, max);
+        if (max == i) {
+            ans++;
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,13 @@
+function maxChunksToSorted(arr: number[]): number {
+    const n = arr.length;
+    let ans = 0;
+    let max = 0;
+    for (let i = 0; i < n; i++) {
+        let cur = arr[i];
+        max = Math.max(cur, max);
+        if (max == i) {
+            ans++;
+        }
+    }
+    return ans;
+};