215 Kth Largest Element in an Array

我会说我直接用了 heapq这么无耻的方法吗 :)  这道题应该直观用heap 复杂度为O(nlgk)

 

import heapq
class Solution:
    # @param {integer[]} nums
    # @param {integer} k
    # @return {integer}
    def findKthLargest(self, nums, k):
        return heapq.nlargest(k, nums)[-1]