# Solution For Best Time To Buy And Sell Stock Ii

Problem Statement:

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Find the maximum profit you can achieve. 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 simultaneously (i.e., you must sell the stock before you buy again).

Example 1:

Input: prices = [7,1,5,3,6,4]
Output: 7

Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.

Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Total profit = 4 + 3 = 7.

Example 2:

Input: prices = [1,2,3,4,5]
Output: 4

Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.

Total profit = 4.

Example 3:

Input: prices = [7,6,4,3,1]
Output: 0

Explanation: In this case, no transactions are done and the max profit = 0.

Solution:

We just need to find the valley (lowest point) and peak (highest point) in the given array of stock prices. We can simply traverse the array and keep a check for every increment in price. Whenever we encounter a point where the price is smaller than the previous one, we simply set Valley = current price and Peak = 0. Whenever we encounter a point where the price is greater than the previous one, we simply set Peak = current price and add (Peak – Valley) to our profit.

Algorithm:

– Initialize the current price to the price of the first day

– Initialize the maximum profit to 0

– Iterate through the list of prices

– If the current price is greater than the previous price, add the difference to the maximum profit

– Update the current price

– Return the maximum profit

Code:

class Solution:

def maxProfit(self, prices: List[int]) -> int:

currentPrice = prices[0]
maxProfit = 0

```
for i in range(1, len(prices)):
if prices[i] > currentPrice:
maxProfit += prices[i] - currentPrice
currentPrice = prices[i]
return maxProfit
```

Time complexity: O(n)

Space complexity: O(1)

Explanation:

We first initialize the current price to the price of the first day and the maximum profit to 0. We then iterate through the list of prices, starting from the second day, and check if the current price is greater than the previous price. If it is, we add the difference between the current price and the previous price to the maximum profit. We then update the current price. Finally, we return the maximum profit. This algorithm is of time complexity O(n) and space complexity O(1).

## Step by Step Implementation For Best Time To Buy And Sell Stock Ii

class Solution { public int maxProfit(int[] prices) { int total = 0; for (int i=0; i< prices.length-1; i++) { if (prices[i+1]>prices[i]) total += prices[i+1]-prices[i]; } return total; } } /* This solution is based on the idea that we can make a profit by buying at a low price and selling at a high price. We can do this as many times as we want as long as there is a profit to be made. This solution simply goes through the prices array and calculates the profit made from each individual transaction. It then adds up all the profits to get the total profit.

class Solution: def maxProfit(self, prices: List[int]) -> int: # keep track of whether we own stock or not # as well as the maximum profit own = False max_profit = 0 # loop through the prices for i in range(len(prices) - 1): # if the current price is greater than the next price # and we don't own stock, buy it if prices[i] < prices[i+1] and not own: own = True buy_price = prices[i] # if the current price is less than the next price # and we own stock, sell it elif prices[i] > prices[i+1] and own: own = False sell_price = prices[i] # calculate the profit and add it to the maximum profit profit = sell_price - buy_price max_profit += profit # if we looped through the entire list and still own stock # sell it at the last price if own: sell_price = prices[-1] profit = sell_price - buy_price max_profit += profit return max_profit

var maxProfit = function(prices) { let profit = 0; for (let i = 1; i < prices.length; i++) { if (prices[i] > prices[i-1]) { profit += prices[i] - prices[i-1]; } } return profit; };

class Solution { public: int maxProfit(vector& prices) { int total = 0; for (int i=0; i< prices.size()-1; i++) { if (prices[i+1]>prices[i]) total += prices[i+1]-prices[i]; } return total; } };

class Solution { public int MaxProfit(int[] prices) { int profit = 0; for(int i = 1; i < prices.Length; i++) { if(prices[i] > prices[i-1]) { profit += prices[i] - prices[i-1]; } } return profit; } }