My Python version (in-place, no reverse): def add1(arr, val, n): todo = abs(n) or len(arr) seq = xrange(0, len(arr), 1) if n >= 0 else xran

My Python version (in-place, no reverse): def add1(arr, val, n): todo = abs(n) or len(arr) seq = xrange(0, len(arr), 1) if n >= 0 else xrange(len(arr) - 1, 0, -1) for i in seq: if arr[i] == val: arr[i] += 1 todo -= 1 if not todo: break return arr