【Leetcode】排序相关

def findKthLargest(self, nums: List[int], k: int) -> int:
        def quick_sort(arr, l, r, k):
            # if l >= r:
            #     return
            item = arr[l]
            i, j = l, r
            while i < j:
                while arr[j] <= item and i < j:
                    j -= 1
                if i < j:
                    arr[i], arr[j] = arr[j], arr[i]
                while arr[i] >= item and i < j:
                    i += 1
                if i < j:
                    arr[i], arr[j] = arr[j], arr[i]
            if i == k-1:
                return arr[i]
            elif i < k-1:
                return quick_sort(arr, i+1, r, k)
            else:
                return quick_sort(arr, l, i-1, k)
            
        n =  len(nums)
        res = quick_sort(nums, 0, n - 1, k)
        return res