leetcode【215】Kth Largest Element in an Array

写在最前面：

没有那个排序的话，这道题很简单。

 

leetcode【215】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.

Example 1:

Input: [3,2,1,5,6,4] and k = 2
Output: 5

Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4

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

class Solution:
    def findKthLargest(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        nums = sorted(nums)
        return nums[len(nums)-k]

 

 你要是愿意自己排序也可以，不过很多复杂度太高的都会超时，最近会写一下关于排序的。