We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 46a8666 commit 1b560a3Copy full SHA for 1b560a3
Medium/Minimum Moves to Equal Array Elements II.java
@@ -1,17 +1,12 @@
1
class Solution {
2
- public int minMoves2(int[] nums) {
3
- int i = 0;
4
- int j = nums.length-1;
5
- int c = 0;
6
-
7
- Arrays.sort(nums);
8
9
- while (i < j) {
10
- c += nums[j] - nums[i];
11
- i++;
12
- j--;
13
- }
14
15
- return c;
+ public int minMoves2(int[] nums) {
+ Arrays.sort(nums);
+ int sum = 0;
+ int start = 0;
+ int end = nums.length - 1;
+ while (start < end) {
+ sum += nums[end--] - nums[start++];
16
}
+ return sum;
+ }
17
0 commit comments