fork download
  1. class Solution:
  2. def FirstNegativeInteger(self, arr, k):
  3. n = len(arr)
  4. ans = [0]*(n-k+1)
  5. prev = -1
  6. for i in range(n):
  7. if arr[i] >= 0: continue
  8. for beg in range(max(prev+1, i-k+1), min(i+1, n-k+1)):
  9. ans[beg] = arr[i]
  10. prev = i
  11. return ans
Success #stdin #stdout 0.09s 14196KB
stdin
Standard input is empty
stdout
Standard output is empty