[leetcode] 121. Best Time to Buy and Sell Stock


Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.


这道题和股票有关,给定一只股票连续n天的股价,在只买入和卖出一次的情况下如何获得最大收益。题目难度为Medium。

每一天的操作分三种情况,不操作、买入或卖出,不操作的情况最大收益不变。初始收益为0,买入时收益减买入价格,卖出时收益加卖出价格。这样遍历所有天的股价,针对当天买入和卖出的情况分别处理,买入时收益减当天股价;卖出时用买入之后的收益加当天股价,比较新的收益和原最大收益确定新的最大收益。以下代码用profit[0]和profit[1]分别表示买入之后和卖出之后的最大收益。具体代码:

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int profit[2] = {INT_MIN, 0};
        
        for(int i=0; i<prices.size(); i++) {
            profit[1] = max(profit[1], profit[0]+prices[i]);
            profit[0] = max(profit[0], -prices[i]);
        }
        
        return profit[1];
    }
};


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/TstsUgeg/article/details/49929473
个人分类: leetcode
上一篇[leetcode] 287. Find the Duplicate Number
下一篇[leetcode] 122. Best Time to Buy and Sell Stock II
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭