feat: add c solution to lc problem: No.0769

No.0769.Max Chunks To Make Sorted

Author: YangFong

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

@@ -215,6 +215,24 @@ func maxChunksToSorted(arr []int) int {
 }
 ```
 
+### **C**
+
+```c
+#define max(a,b) (((a) > (b)) ? (a) : (b))
+
+int maxChunksToSorted(int *arr, int arrSize) {
+    int res = 0;
+    int mx = -1;
+    for (int i = 0; i < arrSize; i++) {
+        mx = max(mx, arr[i]);
+        if (mx == i) {
+            res++;
+        }
+    }
+    return res;
+}
+```
+
 ### **TypeScript**
 
 ```ts

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

@@ -189,6 +189,24 @@ func maxChunksToSorted(arr []int) int {
 }
 ```
 
+### **C**
+
+```c
+#define max(a,b) (((a) > (b)) ? (a) : (b))
+
+int maxChunksToSorted(int *arr, int arrSize) {
+    int res = 0;
+    int mx = -1;
+    for (int i = 0; i < arrSize; i++) {
+        mx = max(mx, arr[i]);
+        if (mx == i) {
+            res++;
+        }
+    }
+    return res;
+}
+```
+
 ### **TypeScript**
 
 ```ts

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

@@ -0,0 +1,13 @@
+#define max(a,b) (((a) > (b)) ? (a) : (b))
+
+int maxChunksToSorted(int *arr, int arrSize) {
+    int res = 0;
+    int mx = -1;
+    for (int i = 0; i < arrSize; i++) {
+        mx = max(mx, arr[i]);
+        if (mx == i) {
+            res++;
+        }
+    }
+    return res;
+}