贪心算法
面试题
122. Best Time to Buy and Sell Stock II
我的方法:flag记录该买还是该卖,判断不同拐点的状态。模拟了真实的操作,但不是本题条件下的最简单的想法
class Solution {
public int maxProfit(int[] prices) {
int day = prices.length;
boolean flag=true;
if(day==1 || day==0){return 0;}
int buy=prices[0], sell=0, profit=0;
for (int i = 1; i<day;i++){
if(flag && prices[i]<prices[i-1]){
buy=prices[i];
}else if(flag && prices[i]>=prices[i-1]){
flag=false;
sell=prices[i];
}
if((!flag) && prices[i]>=prices[i-1]){
sell=prices[i];
}else if((!flag) && prices[i]<prices[i-1]){
flag=true;
profit+=sell-buy;
buy=prices[i];
}
}
if(!flag){
sell=prices[day-1];
profit+=sell-buy;}
return profit;
}
}
其他solution:
暴力求解法时间复杂度太高
Approach 2: Peak Valley Approach:
比我的方法节约了内存空间。
简单方法:利润是所有连续上升差值的和:
class Solution {
public int maxProfit(int[] prices) {
int maxprofit = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] > prices[i - 1])
maxprofit += prices[i] - prices[i - 1];
}
return maxprofit;
}
}