aboutsummaryrefslogtreecommitdiff
path: root/min_moves_equal_array2.cpp
diff options
context:
space:
mode:
authorjack <[email protected]>2024-06-14 13:13:15 -0600
committerjack <[email protected]>2024-06-14 13:13:15 -0600
commitd343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch)
tree96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /min_moves_equal_array2.cpp
downloadleetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz
leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip
initial
Diffstat (limited to 'min_moves_equal_array2.cpp')
-rw-r--r--min_moves_equal_array2.cpp18
1 files changed, 18 insertions, 0 deletions
diff --git a/min_moves_equal_array2.cpp b/min_moves_equal_array2.cpp
new file mode 100644
index 0000000..e5fcfd0
--- /dev/null
+++ b/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);
+}