leetcode-javascript/0215-kth-largest-element-in-an-array.js at master · Barklim/leetcode-javascript · GitHub

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
/**
 * 215. Kth Largest Element in an Array
 * https://leetcode.com/problems/kth-largest-element-in-an-array/
 * Difficulty: Medium
 *
 * 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.
 */

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var findKthLargest = function(nums, k) {
  return nums.sort((a, b) => a - b)[nums.length - k];
};

// var findKthLargest = function(nums, k) {

//   const min_heap = new MinHeapAdhoc();

//   for (const num of nums) {
//       min_heap.add(num)
//       if (min_heap.heap.length > k) {
//           min_heap.poll();
//       }
//   }

//   return min_heap.heap[0]
// };


// var findKthLargest = function(nums, k) {

//   const max_heap = new MaxHeapAdhoc();

//   for (const num of nums) {
//       max_heap.add(num)
//   }

//   for (let i = 0; i < k - 1; i++) {
//       max_heap.poll();
//   }

//   return max_heap.heap[0]
// };