python版快排 class Solution:def findKthLargest(self, nums: List[int], k: int) -> int:self.quicksort(nums, 0, len(nums)-1)print(nums)return nums[k-1]def quicksort(self, nums, start, end):if start >= end:returnmid = nums[start]left = start
时间:2023-10-17 | 阅读:25