Leetcode 215. Kth Largest Element in an Array(python 快速排序）

class Solution:
    
    def findKthLargest(self, nums: List[int], k: int) -> int:
        
        end = len(nums) - 1
        self.quick_sort(nums, 0, end)
        return nums[-k]
       
    
    def quick_sort(self, alist, first, last):
        if first >= last:
            return alist
            
        mid_value = alist[first]
        low = first
        high = last
        while low < high:
            while low < high and alist[high] >= mid_value:
                high -= 1
            alist[low] = alist[high]

            while low < high and alist[low] < mid_value:
                low += 1
            alist[high] = alist[low]
        
        alist[low] = mid_value
        
        self.quick_sort(alist, first, low-1)
        self.quick_sort(alist, low+1, last)