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

原创 2015年11月19日 16:22:14


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];
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【LeetCode-面试算法经典-Java实现】【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】

【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Say you have a...

Leetcode 121. Best Time to Buy and Sell Stock

噢?一脸黑人问号,这道题目怎么会比之前那题通过率更低?刷完才发现,好像解题方式完全不同,题目的含义大相径庭。题目Say you have an array for which the ith elem...

LeetCode121—Best Time to Buy and Sell Stock

LeetCode121—Best Time to Buy and Sell Stock

Leetcode 121 Best Time to Buy and Sell Stock 单次买卖股票最大收益

假设你有一个数组,里面记录的是每一天的股票的价格。 如果你至多只能完成一次交易(即,买一次股票、卖一次股票),设计一个算法来计算最大收益。...

leetcode_[python/C++]_121/122/123/188.Best Time to Buy and Sell Stock I/II/III/IV

121. Best Time to Buy and Sell Stock [题目] Say you have an array for which the ith element is the p...

LeetCode-121&122&123&188.Best Time to Buy and Sell Stock

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ Say you have an array for which the...

LeetCode OJ-121. Best Time to Buy and Sell Stock(股票问题)

121. Best Time to Buy and Sell Stock Say you have an array for which the ith element is the pri...

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

题意 :给你一串股票数字,你有一次的买入和卖出的机会,求最大的收益(卖出-买入)是多少?我的思路:一开始想的是双循环,果断超时。查询了一下这里要用到动态规划的思想:那么什么是动态规划呢? 动态规划...

LeetCode-121. Best Time to Buy and Sell Stock (Java)

Say you have an array for which the ith element is the price of a given stock on day i. If you we...
  • NOadu
  • NOadu
  • 2017年07月08日 15:16
  • 103

【算法作业6】LeetCode 121. Best Time to Buy and Sell Stock

第六周算法作业:LeetCode 121. Best Time to Buy and Sell Stock
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode] 121. Best Time to Buy and Sell Stock
举报原因:
原因补充:

(最多只允许输入30个字)