Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).
Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).
2 comments:
Could you please format your code better? In a way that's more readable? I don't know how to put. You know, the way it looks in an IDE.
updated.
Post a Comment