Update Solution.java

Author: yanglbme

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

@@ -1,29 +1,33 @@
 class Solution {
+    private int[] nums;
+    private int k;
+
     public int findKthLargest(int[] nums, int k) {
-        int n = nums.length;
-        return quickSort(nums, 0, n - 1, n - k);
+        this.nums = nums;
+        this.k = nums.length - k;
+        return quickSort(0, nums.length - 1);
     }
 
-    private int quickSort(int[] nums, int left, int right, int k) {
-        if (left == right) {
-            return nums[left];
+    private int quickSort(int l, int r) {
+        if (l == r) {
+            return nums[l];
         }
-        int i = left - 1, j = right + 1;
-        int x = nums[(left + right) >>> 1];
+        int i = l - 1, j = r + 1;
+        int x = nums[(l + r) >>> 1];
         while (i < j) {
-            while (nums[++i] < x)
-                ;
-            while (nums[--j] > x)
-                ;
+            while (nums[++i] < x) {
+            }
+            while (nums[--j] > x) {
+            }
             if (i < j) {
                 int t = nums[i];
                 nums[i] = nums[j];
                 nums[j] = t;
             }
         }
         if (j < k) {
-            return quickSort(nums, j + 1, right, k);
+            return quickSort(j + 1, r);
         }
-        return quickSort(nums, left, j, k);
+        return quickSort(l, j);
     }
-}
+}