问题描述:
Say you have an array for which the ith element is the price of a given stock on day i.
给你一个数组,里边的第i个元素存储的是股票在第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).
设计算法找出最大收益。你可以进行多次交易(进行多次买进卖出),但是不能同时进行(在你再一次买进之前必须先卖出)。
问题求解:
贪心算法,复杂度为O(N)。对于该题,买入卖出的次数没有限制,但是再一次买进之前必须先卖出。此时存在一个局部最优当prices[i-1] < prices[i]时,所有的局部最优加起来就是全局最优。
贪心算法,是一种在每一步选择中都采取在当前状态下最好或最优(即最有利)的选择,从而希望导致结果是最好或最优的算法。他所做出的仅是在某种意义上的局部最优解。贪心算法不是对所有问题都能得到整体最优解,但对范围相当广泛的许多问题他能产生整体最优解或者是整体最优解的近似解。
class Solution {
public:
int maxProfit(vector<int>& prices) {
int n = prices.size();
if(n <= 1){
return 0;
}
//初始化全局最优值
int profit = 0;
//初始化局部最优值
int subprofit = 0;
for(int i=1;i<n;i++){
if(prices[i-1] < prices[i]){
//prices[i-1] < prices[i]表示出现局部最优
subprofit = prices[i] - prices[i-1];
profit += subprofit;
}
}
return profit;
}
};