Problem,
Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
Can you solve it without sorting?
Example 1:
Input: nums = [3,2,1,5,6,4], k = 2 Output: 5
Example 2:
Input: nums = [3,2,3,1,2,4,5,5,6], k = 4 Output: 4
Solution,
μ λ ¬μ μ¬μ©νμ§ λͺ»νλ€. μ°μ λλ \(-10^4 <= N <= 10^4\) κ° λ³΄μ₯λμλ€ νμμΌλ, 곡κ°λ³΅μ‘λλ₯Ό ν¬κΈ°νκ³ νμλ€.
class Solution {
private static final int MAGIC = 10000;
public int findKthLargest(int[] nums, int k) {
int[] order = new int[20001];
for (int num : nums) {
order[num < 0 ? (num + MAGIC) : num + MAGIC] += 1;
}
for (int i = order.length - 1, m = k, s = 0; i >= 0; --i) {
if (order[i] > 0)
m -= order[i];
if (m <= 0)
return i < MAGIC ? i - MAGIC : i - MAGIC;
}
return 0;
}
}