Merge 4c10ad8 into 6c947ea

Author: 0xmountaintop

README.md

@@ -72,14 +72,14 @@ cargo test
 0411 | [~~Minimum Unique Word Abbreviation~~](https://leetcode.com/problems/minimum-unique-word-abbreviation/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/minimum-unique-word-abbreviation.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/minimum-unique-word-abbreviation.py) | _O(2^n)_ | _O(n)_ | Hard | 🔒 |
 0421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-xor-of-two-numbers-in-an-array.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-xor-of-two-numbers-in-an-array.py) <br>------</br> [Rust](./kamyu104/src/maximum_xor_of_two_numbers_in_an_array.rs) | _O(n)_ | _O(n)_ | Medium ||
 0461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/hamming-distance.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/hamming-distance.py) <br>------</br> [Rust](./kamyu104/src/hamming_distance.rs) | _O(1)_ | _O(1)_ | Easy ||
+0462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/minimum-moves-to-equal-array-elements-ii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/minimum-moves-to-equal-array-elements-ii.py) <br>------</br> [Rust](./kamyu104/src/minimum_moves_to_equal_array_elements_ii.rs) | _O(n)_  on average | _O(1)_ | Medium ||
 
 <!-- 
 
 =======
 
 <!-- 
 
-0462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | [C++](./C++/minimum-moves-to-equal-array-elements-ii.cpp) [Python](./Python/minimum-moves-to-equal-array-elements-ii.py) | _O(n)_  on average | _O(1)_ | Medium ||
 0477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) | [C++](./C++/total-hamming-distance.cpp) [Python](./Python/total-hamming-distance.py) | _O(n)_ | _O(1)_ | Medium ||
 0645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch/) | [C++](./C++/set-mismatch.cpp) [Python](./Python/set-mismatch.py) | _O(n)_ | _O(1)_ | Easy ||
 0693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/) | [C++](./C++/binary-number-with-alternating-bits.cpp) [Python](./Python/binary-number-with-alternating-bits.py) | _O(1)_ | _O(1)_ | Easy ||

kamyu104/src/main.rs

@@ -4,6 +4,7 @@ mod find_the_difference;
 mod hamming_distance;
 mod maximum_product_of_word_lengths;
 mod maximum_xor_of_two_numbers_in_an_array;
+mod minimum_moves_to_equal_array_elements_ii;
 mod missing_number;
 mod number_of_1_bits;
 mod power_of_four;

kamyu104/src/minimum_moves_to_equal_array_elements_ii.rs

@@ -0,0 +1,20 @@
+// Time:  O(n) on average
+// Space: O(1)
+
+// Quick select solution.
+pub struct Solution {}
+impl Solution {
+    pub fn min_moves2(nums: Vec<i32>) -> i32 {
+        2
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_min_moves2() {
+        assert_eq!(Solution::min_moves2(vec![1, 2, 3]), 2);
+    }
+}