3 ms·
My Python solution: def add1(arr, val, n): it = xrange(len(arr)) if n < 0: it = reversed(it) n *= -1 found
by spicyj 14y ago
My Python solution:
def add1(arr, val, n):
it = xrange(len(arr))
if n < 0:
it = reversed(it)
n *= -1
found = 0
for i in it:
if arr[i] == val:
arr[i] += 1
found += 1
if found == n:
break
return arr
- mef 14y agoOne for ruby 1.9: def add1(arr, val, n) limit = (n == 0 ? arr.length : n.abs) enumerator = (n < 0 ? (arr.length-1).downto(0) : (0).upto(arr.length-1)) enumerator.each do |i| if arr[i] == val arr[i] += 1 limit -= 1 end break if limit == 0 end arr end