懒惰改了 好像很多redundancy
easy好难==
一二三四五
def findKDistantIndices(self, nums: List[int], key: int, k: int) -> List[int]:
ans, i = [], 0
while i<len(nums):
if nums[i]==key:
l = max(ans[-1]+1, i-k) if len(ans)>0 else max(0,i-k)
r = min(len(nums)-1, i+k)
for j in range(l, r+1):
ans.append(j)
i += 1
return ans