|
1
2
|
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). |
题意：股票买入卖出。但是你可以多次买入卖出。但是要保证买入时手里没有股票。
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
public class Solution {
public int maxProfit(int[] prices) {
if(prices==null || prices.length<2)return 0;
int buy=prices[0];
int sum=0;
for(int i=1;i<prices.length;i++){
if(prices[i]>buy){
sum+=prices[i]-buy;
buy=prices[i];
}else{
buy=prices[i];
}
}
return sum;
}
} |
本文转自 努力的C 51CTO博客，原文链接:http://blog.51cto.com/fulin0532/1910666