Search

Best Time to Buy and Sell Stock II

Updated: Mar 24, 2021

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.

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.
Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e., max profit = 0.

Constraints:

  • 1 <= prices.length <= 3 * 104

  • 0 <= prices[i] <= 104

Solution:


class Solution {
    public int maxProfit(int[] prices) {
        int havingstock,nothavingstock;
        havingstock = -prices[0];
        nothavingstock =0;
        
        for(int i=1;i<prices.length;i++)
        {
            havingstock = Math.max(havingstock,nothavingstock-prices[i]);
            nothavingstock = Math.max(nothavingstock,havingstock+prices[i]);
        }
        return nothavingstock;
    }
}


10 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.