215. Kth Largest Element in an Array
难度:Medium
class Solution:
def findKthLargest(self, nums: List[int], k: int) -> int:
left = min(nums) - 1
right = max(nums) + 1
while left + 1 < right:
mid = (left + right) // 2
cnt = 0
for num in nums:
if num >= mid:
cnt += 1
if cnt >= k:
left = mid
else:
right = mid
return left