public
Last active

  • Download Gist
alone
1 2 3 4 5 6 7 8
def not_alone(nums, val):
for e in nums:
if e == val:
s = nums.index(e)
if s != 0 and s != (len(nums) - 1):
nums[s] = max(nums[s-1], nums[s+1])
return nums

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.