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.
class Solution(object):
def findKthLargest(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: int
"""
L = sorted(nums)
return L[len(L)-k]
本文介绍了一种在未排序数组中查找第K大元素的方法。通过将数组排序后选取相应位置的元素来实现,确保了K的有效性并满足1≤K≤数组长度的要求。
374

被折叠的 条评论
为什么被折叠?



