diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/min_moves_equal_array2.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/min_moves_equal_array2.cpp')
-rw-r--r-- | other/min_moves_equal_array2.cpp | 18 |
1 files changed, 18 insertions, 0 deletions
diff --git a/other/min_moves_equal_array2.cpp b/other/min_moves_equal_array2.cpp new file mode 100644 index 0000000..e5fcfd0 --- /dev/null +++ b/other/min_moves_equal_array2.cpp @@ -0,0 +1,18 @@ +#include "leetcode.h" + +class Solution { +public: + int minMoves2(vector<int> &nums) { + sort(nums.begin(), nums.end()); + int mid = nums.size() / 2, steps = 0; + for (int i = 0; i < nums.size(); i++) + steps += abs(nums[i] - nums[mid]); + return steps; + } +}; + +int main() { + Solution obj; + vector<int> nums = {1, 2, 3}; + cout << obj.minMoves2(nums); +} |