1785. Minimum Elements to Add to Form a Given Sum: AC

Author: tan-wei

src/solution/mod.rs

@@ -1345,3 +1345,4 @@ mod s1780_check_if_number_is_a_sum_of_powers_of_three;
 mod s1781_sum_of_beauty_of_all_substrings;
 mod s1782_count_pairs_of_nodes;
 mod s1784_check_if_binary_string_has_at_most_one_segment_of_ones;
+mod s1785_minimum_elements_to_add_to_form_a_given_sum;

src/solution/s1785_minimum_elements_to_add_to_form_a_given_sum.rs

@@ -0,0 +1,81 @@
+/**
+ * [1785] Minimum Elements to Add to Form a Given Sum
+ *
+ * You are given an integer array nums and two integers limit and goal. The array nums has an interesting property that abs(nums[i]) <= limit.
+ * Return the minimum number of elements you need to add to make the sum of the array equal to goal. The array must maintain its property that abs(nums[i]) <= limit.
+ * Note that abs(x) equals x if x >= 0, and -x otherwise.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [1,-1,1], limit = 3, goal = -4
+ * Output: 2
+ * Explanation: You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4.
+ *
+ * Example 2:
+ *
+ * Input: nums = [1,-10,9,1], limit = 100, goal = 0
+ * Output: 1
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= nums.length <= 10^5
+ * 	1 <= limit <= 10^6
+ * 	-limit <= nums[i] <= limit
+ * 	-10^9 <= goal <= 10^9
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/
+// discuss: https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn min_elements(nums: Vec<i32>, limit: i32, goal: i32) -> i32 {
+        let mut temp = 0isize;
+
+        for v in nums {
+            temp += v as isize;
+        }
+
+        let diff = temp - goal as isize;
+        let result = diff / limit as isize;
+
+        (if diff % limit as isize != 0 {
+            result.abs() + 1
+        } else {
+            result.abs()
+        }) as i32
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_1785_example_1() {
+        let nums = vec![1, -1, 1];
+        let limit = 3;
+        let goal = -4;
+
+        let result = 2;
+
+        assert_eq!(Solution::min_elements(nums, limit, goal), result);
+    }
+
+    #[test]
+    fn test_1785_example_2() {
+        let nums = vec![1, -10, 9, 1];
+        let limit = 100;
+        let goal = 0;
+
+        let result = 1;
+
+        assert_eq!(Solution::min_elements(nums, limit, goal), result);
+    }
+}