left >= right) { return left; } let res = left; const mid = left + Math.floor((right - left) / 2); let count = 0; // Count elements <= mid and track the maximum among them for (const num of nums) { if (num <= mid) { count++; res = Math.max(res, num); } } if (count === k) { return res; } else if (count < k) { return this.search(nums, k, Math.max(res + 1, mid + 1), right); } else { return this.search(nums, k, left, res); } } }19:T4b6,from typing import List, Optional class Solution: def findMedian(self, nums: List[int]) -> float: len_nums = len(nums) INT_MIN = -2**31 INT_MAX = 2**31 - 1 if len_nums % 2 == 1: return float(self.search(nums, len_nums // 2 + 1, INT_MIN, INT_MAX)) else: first = self.search(nums, len_nums // 2, INT_MIN, INT_MAX) second = self.search(nums, len_nums // 2 + 1, INT_MIN, INT_MAX) return float(first + second) / 2.0 # Binary search to find the k-th smallest element in the array. def search(self, nums: List[int], k: int, left: int, right: int) -> int: if left >= right: return left res = left mid = left + (right - left) // 2 count = 0 # Count elements <= mid and track the maximum among them for num in nums: if num <= mid: count += 1 res = max(res, num) if count == k: return res elif count < k: return self.search(nums, k, max(res + 1, mid + 1), right) else: return self.search(nums, k, left, res) 1a:T546,#include #include #include using namespace std; class Solution { public: double findMedian(vector nums) { int len = nums.size(); if