-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
462.java
65 lines (60 loc) · 1.98 KB
/
462.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
//用quickselect可以在O(n)时间内找到第k个元素
public int minMoves2(int[] nums) {
int sum = 0;
int median = quickSelect(nums, nums.length /2 + 1, 0, nums.length - 1);
for(int num : nums){
sum += Math.abs(num - median);
}
return sum;
}
public int quickSelect(int[] nums, int k, int start, int end){
int l = start;
int r = end;
int pivot = nums[(l+r) / 2];
while(l <= r){
while(nums[l] < pivot) l++;
while(nums[r] > pivot) r--;
if(l >= r) break;
swap(nums, l++ , r--);
}
//分三种情况,一个是往前,一个正好,一个往后找
if(l - start + 1 > k) return quickSelect(nums, k, start, l -1);
if(l - start + 1 == k && l == r)
return nums[l];
return quickSelect(nums, k - r - 1 + start, r + 1, end);
}
public void swap(int[] nums, int i, int j){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
__________________________________________________________________________________________________
sample 2 ms submission
class Solution {
public int minMoves2(int[] nums) {
Arrays.sort(nums);
int num=nums[nums.length/2];
int result=0;
for(int i=0;i<nums.length;i++) {
result+=Math.abs(nums[i]-num);
}
return result;
}
}
__________________________________________________________________________________________________
sample 39808 kb submission
class Solution {
public int minMoves2(int[] nums) {
Arrays.sort(nums);
int mid = nums.length / 2;
int ans = 0;
for(int i = 0; i < nums.length; i++) {
ans += Math.abs(nums[i] - nums[mid]);
}
return ans;
}
}