思路:
- 排序
- 逆序
- 找索引为k-1的元素
代码:
from typing import List
class Solution:
def findKthLargest(self, nums: List[int], k: int) -> int:
nums.sort(reverse=True)
return nums[k-1]
思路:
代码:
from typing import List
class Solution:
def findKthLargest(self, nums: List[int], k: int) -> int:
nums.sort(reverse=True)
return nums[k-1]