2270. Number of Ways to Split Array: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1718,3 +1718,4 @@ mod s2265_count_nodes_equal_to_average_of_subtree;
 mod s2266_count_number_of_texts;
 mod s2267_check_if_there_is_a_valid_parentheses_string_path;
 mod s2269_find_the_k_beauty_of_a_number;
+mod s2270_number_of_ways_to_split_array;

src/solution/s2270_number_of_ways_to_split_array.rs

@@ -0,0 +1,77 @@
+/**
+ * [2270] Number of Ways to Split Array
+ *
+ * You are given a 0-indexed integer array nums of length n.
+ * nums contains a valid split at index i if the following are true:
+ *
+ * 	The sum of the first i + 1 elements is greater than or equal to the sum of the last n - i - 1 elements.
+ * 	There is at least one element to the right of i. That is, 0 <= i < n - 1.
+ *
+ * Return the number of valid splits in nums.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [10,4,-8,7]
+ * Output: 2
+ * Explanation:
+ * There are three ways of splitting nums into two non-empty parts:
+ * - Split nums at index 0. Then, the first part is [10], and its sum is 10. The second part is [4,-8,7], and its sum is 3. Since 10 >= 3, i = 0 is a valid split.
+ * - Split nums at index 1. Then, the first part is [10,4], and its sum is 14. The second part is [-8,7], and its sum is -1. Since 14 >= -1, i = 1 is a valid split.
+ * - Split nums at index 2. Then, the first part is [10,4,-8], and its sum is 6. The second part is [7], and its sum is 7. Since 6 < 7, i = 2 is not a valid split.
+ * Thus, the number of valid splits in nums is 2.
+ *
+ * Example 2:
+ *
+ * Input: nums = [2,3,1,0]
+ * Output: 2
+ * Explanation:
+ * There are two valid splits in nums:
+ * - Split nums at index 1. Then, the first part is [2,3], and its sum is 5. The second part is [1,0], and its sum is 1. Since 5 >= 1, i = 1 is a valid split.
+ * - Split nums at index 2. Then, the first part is [2,3,1], and its sum is 6. The second part is [0], and its sum is 0. Since 6 >= 0, i = 2 is a valid split.
+ *
+ *  
+ * Constraints:
+ *
+ * 	2 <= nums.length <= 10^5
+ * 	-10^5 <= nums[i] <= 10^5
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/number-of-ways-to-split-array/
+// discuss: https://leetcode.com/problems/number-of-ways-to-split-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn ways_to_split_array(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2270_example_1() {
+        let nums = vec![10, 4, -8, 7];
+
+        let result = 2;
+
+        assert_eq!(Solution::ways_to_split_array(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2270_example_2() {
+        let nums = vec![2, 3, 1, 0];
+
+        let result = 2;
+
+        assert_eq!(Solution::ways_to_split_array(nums), result);
+    }
+}