# write your implementation here def maxProfitBrute(changes): """ it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in . Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day and day has at least a single change [two days] Output: - i: the index of the change before which we buy - j: the index of the change after which we sell - maxProfit: the value of the maximum profit Example: changes = [1,2] - that means the price started with ; - day 1: it became - day 2: it became In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day """ # return the values return (0,0,0)
# write your implementation here
def maxProfitBrute(changes):
"""
it returns the indices of (i,j) indicating the day to buy and sell respectively
to have the maximum profit in a list of prices per day in <changes>.
Inputs:
- changes: the list holding the changes in prices; the value whose index is k represents
the change between day <k> and day <k+1>
<changes> has at least a single change [two days]
Output:
- i: the index of the change before which we buy
- j: the index of the change after which we sell
- maxProfit: the value of the maximum profit
Example:
changes = [1,2]
- that means the price started with <x>;
- day 1: it became <x+1>
- day 2: it became <x+3>
In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day
"""
# return the values
return (0,0,0)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
