Best Time to Buy and Sell Stock II – LeetCode Solution Java , Python 3, Python 2 , C , C++, Best and Optimal Solutions , All you need.

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

On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.

Find and return the maximum profit you can achieve.

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 is 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 is 4.

Example 3:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.

Constraints:

• 1 <= prices.length <= 3 * 104
• 0 <= prices[i] <= 104

C++ Best Time to Buy and Sell Stock II LeetCode Solution

class Solution {

public:

int maxProfit(vector& prices) {

int n=prices.size();
 
    int i,sum=0;
    for(i=1;i<n;i++) 
    {
       if(prices[i]>prices[i-1])
       {
           sum+=prices[i]-prices[i-1];
       }
    }
    return sum;
}

 
};

Java Best Time to Buy and Sell Stock II LeetCode Solution

public int maxProfit(int[] prices) {
        int buyingDate = 0, sellingDate = 0, profit = 0;
        for(int i = 1; i < prices.length;i++){
            if(prices[i] >= prices[i-1]){
                sellingDate++;
            }else{
                profit += prices[sellingDate] -  prices[buyingDate];
                buyingDate = sellingDate = i;
            }
        }
        profit += prices[sellingDate] -  prices[buyingDate];
        return profit;
    }
}
 

Python 3 Best Time to Buy and Sell Stock II LeetCode Solution

 def maxProfit(self, prices: List[int]) -> int:
        profit = 0
        for i in range(1,len(prices)):
            if prices[i] >prices[i-1]:
                profit+=prices[i]-prices[i-1]
        return profit

Array-1180
String-562
Hash Table-412
Dynamic Programming-390
Math-368
Sorting-264
Greedy-257
Depth-First Search-256
Database-215
Breadth-First Search-200
Tree-195
Binary Search-191
Matrix-176
Binary Tree-160
Two Pointers-151
Bit Manipulation-140
Stack-133
Heap (Priority Queue)-117
Design-116
Graph-108
Simulation-103
Prefix Sum-96
Backtracking-92
Counting-86
Sliding Window-73
Linked List-69
Union Find-66
Ordered Set-48
Monotonic Stack-47
Recursion-43
Trie-41
Binary Search Tree-40
Divide and Conquer-40
Enumeration-39
Bitmask-37
Queue-33
Memoization-32
Topological Sort-31
Geometry-30
Segment Tree-27
Game Theory-24
Hash Function-24
Binary Indexed Tree-21
Interactive-18
Data Stream-17
String Matching-17
Rolling Hash-17
Shortest Path-16
Number Theory-16
Combinatorics-15
Randomized-12
Monotonic Queue-9
Iterator-9
Merge Sort-9
Concurrency-9
Doubly-Linked List-8
Brainteaser-8
Probability and Statistics-7
Quickselect-7
Bucket Sort-6
Suffix Array-6
Minimum Spanning Tree-5
Counting Sort-5
Shell-4
Line Sweep-4
Reservoir Sampling-4
Eulerian Circuit-3
Radix Sort-3
Strongly Connected Componen-t2
Rejection Sampling-2
Biconnected Component-1

Leave a comment below

Related posts:

Best Time to Buy and Sell Stock – LeetCode Solution LeetCode All Array Solution List – all in one place Search Insert Position – LeetCode Solution First Missing Positive – LeetCode Solution Sort Colors – LeetCode Solution Pascal’s Triangle – LeetCode Solution