题目:
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 (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
Subscribe to see which companies asked this question
贪心法,只要当前股票价格相比头天有所上升就将其加起来
public class Solution {
public int maxProfit(int[] prices) {
int max = 0;
for(int i=1;i<prices.length;i++)
{
int dif = prices[i]-prices[i-1];
if(dif>0)
{
max+=dif;
}
}
return max;
}
}