Update Solution.py

Author: yanglbme

solution/0200-0299/0215.Kth Largest Element in an Array/Solution.py

@@ -1,10 +1,10 @@
 class Solution:
     def findKthLargest(self, nums: List[int], k: int) -> int:
-        def quick_sort(left, right, k):
-            if left == right:
-                return nums[left]
-            i, j = left - 1, right + 1
-            x = nums[(left + right) >> 1]
+        def quick_sort(l: int, r: int) -> int:
+            if l == r:
+                return nums[l]
+            i, j = l - 1, r + 1
+            x = nums[(l + r) >> 1]
             while i < j:
                 while 1:
                     i += 1
@@ -17,8 +17,9 @@ def quick_sort(left, right, k):
                 if i < j:
                     nums[i], nums[j] = nums[j], nums[i]
             if j < k:
-                return quick_sort(j + 1, right, k)
-            return quick_sort(left, j, k)
+                return quick_sort(j + 1, r)
+            return quick_sort(l, j)
 
         n = len(nums)
-        return quick_sort(0, n - 1, n - k)
+        k = n - k
+        return quick_sort(0, n - 1)