Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
An integer a is closer to x than an integer b if:
|a - x| < |b - x|, or
|a - x| == |b - x| and a < b
Example 1:
Input:arr = [1,2,3,4,5], k = 4, x = 3Output:[1,2,3,4]
Example 2:
Input:arr = [1,1,2,3,4,5], k = 4, x = -1Output:[1,1,2,3]
Constraints:
1 <= k <= arr.length
1 <= arr.length <= 10โด
arr is sorted in ascending order.
-10โด <= arr[i], x <= 10โด
Solutions
๐ Already have an account?
Please log in to view the solution
๐ Don't have an account yet?
Access to detailed solutions requires an active subscription account. Get one now ๐
๐ Premium Content
This solution requires an active subscription to view.