feat: add more

Author: gengjiawen

pools_todo/_0453_minimum_moves_to_equal_array_elements.rs renamed to Array/_0453_minimum_moves_to_equal_array_elements.rs

@@ -1,36 +1,43 @@
 // https://leetcode.com/problems/minimum-moves-to-equal-array-elements
-// 
+//
 // Given an integer array `nums` of size `n`, return _the minimum number of moves required to make all array elements equal_.
-// 
+//
 // In one move, you can increment `n - 1` elements of the array by `1`.
-// 
+//
 // **Example 1:**
-// 
+//
 // ```
 // **Input:** nums = [1,2,3]
 // **Output:** 3
 // **Explanation:** Only three moves are needed (remember each move increments two elements):
 // [1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]
 // ```
-// 
+//
 // **Example 2:**
-// 
+//
 // ```
 // **Input:** nums = [1,1,1]
 // **Output:** 0
 // ```
-// 
+//
 // **Constraints:**
-// 
+//
 // *   `n == nums.length`
 // *   `1 <= nums.length <= 10<sup>5</sup>`
 // *   `-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup>`
 // *   The answer is guaranteed to fit in a **32-bit** integer.
 
 pub fn min_moves(nums: Vec<i32>) -> i32 {
-
+    let mut min = nums[0];
+    let mut sum = nums[0];
+    for i in 1..nums.len() {
+        min = min.min(nums[i]);
+        sum += nums[i];
     }
+    return sum - min * nums.len() as i32;
+}
 
 #[test]
 pub fn t1() {
+    assert_eq!(min_moves(vec![1, 2, 3]), 3);
 }

Array/lib.rs

@@ -12,6 +12,7 @@ mod _0347_top_k_frequent_elements;
 mod _0349_intersection_of_two_arrays;
 mod _0350_intersection_of_two_arrays_ii;
 mod _0448_find_all_numbers_disappeared_in_an_array;
+mod _0453_minimum_moves_to_equal_array_elements;
 mod _0463_island_perimeter;
 mod _0485_max_consecutive_ones;
 mod _0495_teemo_attacking;