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

Say you have an array for which the ith element is the price of a given stock on day i.

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).

	#include <iostream>
	#include <vector>
	int maxProfit( const std::vector<unsigned int> &prices )
	{
	// Prevent against extreme case
	if(prices.size() <= 1)
	{
	return 0;
	}
	int profit = 0;
	// Calculate the profit, loop through prices and
	// keep on adding to profit when we are from
	// velly to peak, as we need to buy and sell
	for(int i =0 ; i< prices.size()-1 ; i++ )
	{
	if(prices[i] < prices[i+1])
	{
	profit += prices[i+1] - prices[i];
	}
	}
	return profit;
	}
	int main()
	{
	std::vector<unsigned int> nums ={7,1,5,3,6,4};
	// should return 7 for this case
	std::cout<< maxProfit(nums) << std::endl;
	return 0;
	}

view raw MaxProfit.cpp hosted with ❤ by GitHub