class Solution { public: void swap(std::vector<int>& nums, int i, int j) { int tmp = nums[i]; nums[i] = nums[j]; nums[j] = tmp; } int findKthLargest(std::vector<int>& nums, int k) { int start = 0; int end = nums.size() - 1; int kb = k; while (true) { int i = start; int j = end; int mid = nums[(i + j) / 2]; ...