[Sort] Refactor solution to Kth Largest Element in an Array

soapyigu · soapyigu · commit dcdf4313c8c7 · 2019-09-16T21:03:09.000-07:00
diff --git a/Sort/KthLargestElementInArray.swift b/Sort/KthLargestElementInArray.swift
@@ -20,14 +20,10 @@ class KthLargestElementInArray {
         
         if leftPart.count > k - 1 {
             return findKthLargest(leftPart, k)
-        } else if leftPart.count == k - 1 {
-            return pivot
+        } else if k - leftPart.count <= middlePart.count {
+            return findKthLargest(middlePart, k - leftPart.count)
         } else {
-            if k - leftPart.count <= middlePart.count {
-                return findKthLargest(middlePart, k - leftPart.count)
-            } else {
-                return findKthLargest(rightPart, k - leftPart.count - middlePart.count)
-            }
-        } 
+            return findKthLargest(rightPart, k - leftPart.count - middlePart.count)
+        }
     }
 }
