diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_moves_equal_array2.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_moves_equal_array2.cpp')
-rw-r--r-- | other/min_moves_equal_array2.cpp | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/other/min_moves_equal_array2.cpp b/other/min_moves_equal_array2.cpp deleted file mode 100644 index e5fcfd0..0000000 --- a/other/min_moves_equal_array2.cpp +++ /dev/null @@ -1,18 +0,0 @@ -#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); -} |