#!/usr/bin/python
import math
def remvoeDulpicates(array):
for i in range(len(array)):
j = i + 1
while(j < len(array)):
if array[i] == array[j]:
del array[j]
# j = j - 1
else :
j = j + 1
# j = j + 1;
def maxProfit(prices):
inP = -1
outP = -1
pos = 0
flag = 0
for i in range(0, len(prices)):
for j in range(i + 1, len(prices)):
print("inP %d outP %d" %(inP, outP))
if (prices[i] < prices[j]):
inP = prices[i]
elif (prices[i] >= prices[j]) and (inP == -1):
print("break")
break;
if (inP != -1) and (prices[j] > outP):
outP = prices[j]
if (pos < len(prices) - 1):
pos = j+1
if ( inP != -1 ) and (outP != -1) and (j == len(prices) - 1):
print "1. flag"
print("inP %d outP %d" %(inP, outP))
flag = 1
if (inP != -1) and (outP != -1) and (prices[j] < outP):
print "2.flag"
flag = 1;
break;
print("flag is %d" %(flag))
if (flag == 1):
break;
if (inP != -1 ) and (outP != -1):
if (pos < len(prices)):
return outP - inP + maxProfit(prices[pos:])
else :
return outP - inP
elif (inP == -1 ) and (outP == -1):
return 0
def rotate(matrix):
width= height = len(matrix)
print(" %d * %d" %(width, height))
for h in range(int(height/2)):
for w in range(h,width - h -1):
print(matrix[h][w])
mid = matrix[w][width -1 - h]
matrix[w][width -1 - h] = matrix[h][w]
matrix[h][w] = matrix[height -1 -h][height - 1- w]
matrix[width -1 - h][height -1 -w] = mid
mid = matrix[height -1 - w][h]
matrix[height - 1 - w][h] = matrix[h][w]
matrix[h][w] = mid
def containsDuplicatexx(nums):
length = len(nums)
for j in range(1, length):
if nums[0] == nums[j]:
return True
if length > 1:
return containsDuplicatexx(nums[1:])
else :
return False
def containsDuplicate1(nums):
length = len(nums)
for i in range(length):
for j in range(i + 1, length):
if nums[i] == nums[j]:
return True
return False
def containsDuplicate2(nums):
nums.sort()
for i in range(len(nums) - 1):
if nums[i] == nums[i + 1]:
return True
return False