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).
题目的意思是给一个数组,数组中数代表股票价格,第i个数代表第i天的价格,现在让你来买卖,计算最多能得到多少利润。这个题目给的难度是中等,其实很简单,只要今天的价格比昨天的高,那么高出的部分一定是利润。
public class Solution {
public int maxProfit(int[] prices) {
if (prices.length < 2) {
return 0;
}
int income = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] > prices[i - 1]) {
income += (prices[i] - prices[i - 1]);
}
}
return income;
}
}