标签：leetcode solution tin kth self search ever col div
mycode 77.39%
class Solution(object): def findKthLargest(self, nums, k): """ :type nums: List[int] :type k: int :rtype: int """ nums.sort() return nums[-k]
参考
class Solution(object): def findKthLargest(self, nums, k): nums.sort(reverse=True) return nums[k-1]
leetcode-mid-array-sorting and searching - 215 Kth Largest Element in an Array
标签：leetcode solution tin kth self search ever col div
原文地址：https://www.cnblogs.com/rosyYY/p/10974677.html
