LeetCode 솔루션 분류
[9/29] 658. Find K Closest Elements
본문
Medium
6025493Add to ListShareGiven 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|anda < b
Example 1:
Input: arr = [1,2,3,4,5], k = 4, x = 3 Output: [1,2,3,4]
Example 2:
Input: arr = [1,2,3,4,5], k = 4, x = -1 Output: [1,2,3,4]
Constraints:
1 <= k <= arr.length1 <= arr.length <= 104arris sorted in ascending order.-104 <= arr[i], x <= 104
Accepted
374,365
Submissions
803,741
관련자료
-
링크
댓글 1
학부유학생님의 댓글
- 익명
- 작성일
Runtime: 332 ms, faster than 87.78% of Python3 online submissions for Find K Closest Elements.
Memory Usage: 15.5 MB, less than 80.93% of Python3 online submissions for Find K Closest Elements.
Memory Usage: 15.5 MB, less than 80.93% of Python3 online submissions for Find K Closest Elements.
class Solution:
def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:
l, r = 0, len(arr)-1
while r - l + 1 > k:
if abs(arr[r] - x) >= abs(arr[l] - x):
r -= 1
else:
l += 1
return arr[l:r+1]
