215. 数组中的第K个最大元素
k次冒泡排序
var findKthLargest = function(nums, k) {
const bubble = (n) => {
//保证右侧元素最大
for(let i = 1; i < nums.length - n; i++) {
if(nums[i] < nums[i-1]) {
let t = nums[i]
nums[i] = nums[i-1]
nums[i-1] = t
}
}
}
for(let i = 0; i < k; i++) {
bubble(i)
}
return nums[nums.length - k]
};
k = n 时,时间复杂度为O(n2)
k次堆排序(大顶堆)
var findKthLargest = function(nums, k) {
let len = nums.length
const heapify = (index) => {
let [left, right, max] = [2*index+1, 2*index+2, index]
//注意此处应该是下标小于len,而不是下标有意义
if(left < len && nums[left] > nums[max]) max = left
if