[LeetCode]Kth Largest Element in an Array

Kth Largest Element in an Array

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

For example,
Given [3,2,1,5,6,4] and k = 2, return 5.

Note: 
You may assume k is always valid, 1 ≤ k ≤ array's length.

https://leetcode.com/problems/kth-largest-element-in-an-array/

 

 

---

 

 

排一下序直接输出就好了。

我还以为要剔掉重复的数字，然后被这个test case教做人orz。

Input: [-1,-1], 2
Output: NaN
Expected: -1

不过这题是medium难度哎，排个序是不是算作弊...

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