-
Notifications
You must be signed in to change notification settings - Fork 0
/
LeetCode_215_2.java
36 lines (35 loc) · 1.02 KB
/
LeetCode_215_2.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
public class LeetCode_215_2 {
// 快排
class Solution {
public int findKthLargest(int[] nums, int k) {
quick_sort(nums, 0, nums.length - 1);
for (int num : nums) {
System.out.println("nums: " + num);
}
return nums[k - 1];
}
public void quick_sort(int[] nums, int left, int right) {
if (left == right)
return;
int l = left - 1;
int r = right + 1;
int mid = (left + right) / 2;
int x = nums[mid];
while (l < r) {
do {
l++;
} while (nums[l] > x);
do {
r--;
} while (nums[r] < x);
if (l < r) {
int temp = nums[l];
nums[l] = nums[r];
nums[r] = temp;
}
}
quick_sort(nums, left, r);
quick_sort(nums, r + 1, right);
}
}
}