Add 768 and 769 solution

Author: lidongjies

src/solution/mod.rs

@@ -11,6 +11,8 @@ mod s0623_add_one_row_to_tree;
 mod s0636_exclusive_time_of_function;
 mod s0640_solve_the_equation;
 mod s0761_special_binary_string;
+mod s0768_max_chunks_to_make_sorted_ii;
+mod s0769_max_chunks_to_make_sorted;
 mod s0899_orderly_queue;
 mod s1282_group_the_people_given_the_group_size_they_belong_to;
 mod s1374_generate_a_string_with_characters_that_have_odd_counts;

src/solution/s0768_max_chunks_to_make_sorted_ii.rs

@@ -0,0 +1,35 @@
+/**
+ * [768] max chunks to make sorted II
+ * https://leetcode.cn/problems/max-chunks-to-make-sorted-ii/
+ */
+
+pub struct Solution {}
+
+impl Solution {
+    pub fn max_chunks_to_sorted(arr: Vec<i32>) -> i32 {
+        let mut strategy = 0_i32;
+        let mut sorted_arr = arr.clone();
+        sorted_arr.sort();
+        let mut sum_arr = 0;
+        let mut sum_arr_sorted = 0;
+        for i in 0..arr.len() {
+            sum_arr += arr[i];
+            sum_arr_sorted += sorted_arr[i];
+            if sum_arr == sum_arr_sorted {
+                strategy += 1;
+            }
+        }
+        strategy
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_0768() {
+        assert_eq!(Solution::max_chunks_to_sorted(vec![5, 4, 3, 2, 1]), 1);
+        assert_eq!(Solution::max_chunks_to_sorted(vec![2, 1, 3, 4, 4]), 4);
+    }
+}

src/solution/s0769_max_chunks_to_make_sorted.rs

@@ -0,0 +1,31 @@
+/**
+ * [769] max chunks to make sorted
+ * https://leetcode.cn/problems/max-chunks-to-make-sorted/
+ */
+
+pub struct Solution {}
+
+impl Solution {
+    pub fn max_chunks_to_sorted(arr: Vec<i32>) -> i32 {
+        let mut strategy = 0_i32;
+        let mut max = 0_i32;
+        for (index, number) in arr.iter().enumerate() {
+            max = max.max(*number);
+            if (index as i32) == max {
+                strategy += 1;
+            }
+        }
+        strategy
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_0769() {
+        assert_eq!(Solution::max_chunks_to_sorted(vec![4, 3, 2, 1, 0]), 1);
+        assert_eq!(Solution::max_chunks_to_sorted(vec![1, 0, 2, 3, 4]), 4);
+    }
+}