Weekly Contest 284
# 1 - 2200. 找出数组中的所有 K 近邻下标 class Solution: def findKDistantIndices(self, nums: List[int], key: int, k: int) -> List[int]: n = len(nums) # idxs = [i for i in range(n) if nums[i] == key] res = [] for i in range(n): for j in range(max(0, i - k), min(n, i + k + 1)): if nums[j] == key: res.append(i)...
more...