-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFindKthLargestElement.java
62 lines (51 loc) · 1.55 KB
/
FindKthLargestElement.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
import java.util.Arrays;
// my soluton_USE Arrays
public class FindKthLargestElement {
public static void main(String[] args) {
System.out.println(new FindKthLargestElement().findKthLargest(new int[]{5, 2, 4, 3, 1},2));
}
public int findKthLargest(int[] nums, int k) {
Arrays.sort(nums);
return nums[nums.length-k];
}
}
/* USE_quickSort
class Solution {
public int findKthLargest(int[] nums, int k) {
if (nums == null) {
return -1;
}
return quickSelect(nums, 0, nums.length - 1, nums.length - k + 1);
}
private int quickSelect(int[] nums, int start, int end, int k) {
if (start == end) {
return nums[start];
}
int mid = start + (end - start) / 2;
int pivot = nums[mid];
int i = start, j = end;
while (i <= j) {
while (i <= j && nums[i] < pivot) {
i++;
}
while (i <= j && nums[j] > pivot) {
j--;
}
if (i <= j) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
i++;
j--;
}
}
if (start + k - 1 <= j) {
return quickSelect(nums, start, j, k);
}
if (start + k - 1 >= i) {
return quickSelect(nums, i, end, k-(i-start));
}
return nums[j+1];
}
}
*/