leetcode數組中查找數，[leetcode]求數組的第k個最大值，python快排解法

2023-10-17 阅读 30 评论 0

摘要：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

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 = startright = endwhile left < right:while left < right and nums[right] <= mid:right -= 1nums[left] = nums[right]while left < right and nums[left] > mid:left += 1nums[right] = nums[left]nums[left] = midself.quicksort(nums, start, left-1)self.quicksort(nums, left+1, end)