Leetcode problem-122 best time to Buy and Sell Stock II

Leetcode Problem-122 Best time to Buy and Sell Stock II

Say You has an array for which the I th element is the price of a given stock on day I .

Design an algorithm to find the maximum profit. You could complete as many transactions as (ie, buy one and sell one share of the stock multiple times). However, engage in multiple transactions for the same time (ie, you must sell the stock before you buy again).

The puzzle: The greedy method, the low price into the high price, the sum of all the positive prices.

Class Solution { Public int Maxprofit (vector<int>& prices) { int sum = 0; int dif = 0; for (int i = 1; i < prices.size (); i++)         { dif = prices[i]-prices[i-1]; if (dif > 0) sum + = dif;         } return sum;     } };

Leetcode problem-122 best time to Buy and Sell Stock II