第一个代码:
def Maximum__profit_more_efficient(list):
"""compute the maximum_profit of specific stock"""
selling_date = 0
buying_date = 0
for i in range(len(list)):
if list[i] > list[selling_date]:
selling_date = i
for j in range(len(list)):
if list[j] < list[buying_date] and j <= selling_date:
buying_date = j
elif j > selling_date:
break
print(list[selling_date] - list[buying_date])
第二个代码:
def brute_force(list):
"""compute the maximum_profit of specific stock, but with higher complexity"""
selling_date = 0
buying_date = 0
i = 0
j = 0
exit = False
while exit == False:
if list[i] > list[selling_date]:
selling_date = i
if i < len(list):
i = i + 1
if i == len(list):
while j < len(list):
if list[j] < list[buying_date] and j <= selling_date:
buying_date = j
j = j + 1
if j == len(list):
exit = True
print(list[selling_date] - list[buying_date])
正如您所猜测的,第一个代码的复杂性是O(n(。但是第二个代码的复杂性也是O(n(。即使在第二个代码中有一个嵌套的循环,由于j的值在循环外只设置一次为0,因此时间复杂性仅为O(n(。