FilesExpand file tree

 main

/

MaximizeProfitStockProblem.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (27 loc) · 950 Bytes

 main

/

MaximizeProfitStockProblem.py

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (27 loc) · 950 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

# Module to return the maximum profit that can be made after buying and selling the given stocks

def maxProfit(price, start, end):

# If the stocks can't be bought

if (end <= start):

return 0

# Initialise the profit

profit = 0

# The day at which the stock must be bought

for i in range(start, end, 1):

# The day at which the stock must be sold

for j in range(i+1, end+1):

# If buying the stock at ith day and selling it at jth day is profitable

if (price[j] > price[i]):

# Update the current profit

current_profit = price[j] - price[i] +\

maxProfit(price, start, i - 1) + \

maxProfit(price, j + 1, end)

# Update the maximum profit so far

profit = max(profit, current_profit)

return profit

# Example Driver Code

if __name__ == '__main__':

price = [100, 180, 260, 310, 40, 535, 695]

n = len(price)

print(maxProfit(price, 0, n - 1))

# Solution: 865

# This code is contributed by Laksh Gupta