Update the-k-strongest-values-in-an-array.cpp

Author: kamyu104

C++/the-k-strongest-values-in-an-array.cpp

@@ -17,6 +17,26 @@ class Solution {
 // Time:  O(nlogn)
 // Space: O(1)
 class Solution2 {
+public:
+    vector<int> getStrongest(vector<int>& arr, int k) {
+        sort(begin(arr), end(arr));
+        const auto m = arr[(arr.size() -1) / 2];
+        int left = 0, right = arr.size() - 1;
+        vector<int> result;
+        while (result.size() < k) {
+            if (m - arr[left] > arr[right] - m) {
+                result.push_back(arr[left++]);  
+            } else {
+                result.push_back(arr[right--]);
+            }
+        }
+        return result;
+    }
+};
+
+// Time:  O(nlogn)
+// Space: O(1)
+class Solution3 {
 public:
     vector<int> getStrongest(vector<int>& arr, int k) {
         sort(begin(arr), end(arr));