Skip to content

Instantly share code, notes, and snippets.

@joxer
Created March 14, 2019 11:08
Show Gist options
  • Save joxer/d645c25f0dd0f8e6488264acca4cb9d3 to your computer and use it in GitHub Desktop.
Save joxer/d645c25f0dd0f8e6488264acca4cb9d3 to your computer and use it in GitHub Desktop.
def move_left(array):
idx = 0
ri = len(array)-1
while(idx < ri):
if(array[idx] <= 0):
array[idx], array[ri] = array[ri], array[idx]
ri -=1
else:
idx+=1
if(array[idx] <= 0):
ri -= 1
return [array, ri]
def max_value(array, ri):
idx = 0
max = abs(array[idx])
while(idx < ri):
if( abs(array[idx]) > max):
max = abs(array[idx])
idx+=1
return max
def solution(array):
array, ri = move_left(array)
idx = 0
while( idx <= ri):
if( array[idx] < len(array)-1):
print(array, array[idx])
array[abs(array[idx])] = -abs(array[array[idx]])
idx+=1
idx = 1
while( idx <= ri):
if(array[idx] > 0):
return idx
idx+=1
print(array)
return max_value(array,ri)+1
array = [3,4,-1,1]
print(solution(array))
array = [1,2,0]
print(solution(array))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment