[LintCode] Best Time to Buy and Sell Stock 买卖股票的最佳时间

  1. 云栖社区>
  2. 博客>
  3. 正文

[LintCode] Best Time to Buy and Sell Stock 买卖股票的最佳时间

李博 bluemind 2017-12-10 18:24:00 浏览692
展开阅读全文

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.

Example

Given array [3,2,3,1,2], return 1.

LeetCode上的原题,请参见我之前的解法Best Time to Buy and Sell Stock

class Solution {
public:
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    int maxProfit(vector<int> &prices) {
        int res = 0, mn = INT_MAX;
        for (int i = 0; i < prices.size(); ++i) {
            mn = min(mn, prices[i]);
            res = max(res, prices[i] - mn);
        }
        return res;
    }
};

本文转自博客园Grandyang的博客,原文链接:买卖股票的最佳时间[LintCode] Best Time to Buy and Sell Stock ,如需转载请自行联系原博主。

网友评论

登录后评论
0/500
评论
李博 bluemind
+ 关注