-
Notifications
You must be signed in to change notification settings - Fork 0
/
215.数组中的第k个最大元素.java
44 lines (40 loc) · 951 Bytes
/
215.数组中的第k个最大元素.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
/*
* @lc app=leetcode.cn id=215 lang=java
*
* [215] 数组中的第K个最大元素
*/
// @lc code=start
class Solution {
public int findKthLargest(int[] nums, int k) {
sort(nums, 0, nums.length - 1);
return nums[nums.length - k];
}
// 升序
private void sort(int[] nums, int start, int end) {
if (start >= end) {
return;
}
int i = start, j = end;
int tmp = nums[i];
while (i < j) {
while (nums[j] >= tmp && i < j) {
j--;
}
if (i < j) {
nums[i] = nums[j];
i++;
}
while (nums[i] <= tmp && i < j) {
i++;
}
if (i < j) {
nums[j] = nums[i];
j--;
}
}
nums[i] = tmp;
sort(nums, start, i - 1);
sort(nums, i + 1, end);
}
}
// @lc code=end