首页 > 其他 > 详细

【Leetcode】Best Time to Buy and Sell Stock

时间:2014-03-27 18:34:07      阅读:540      评论:0      收藏:0      [点我收藏+]

题目:

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.

解题思路:用贪婪算法,遍历数组,找到最大利润序列(差最大的两个时间点)。得到最大利润值。

代码:

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int min_date=0,min_price=INT_MAX,max_profit=0;
        for(int i=0;i<prices.size();i++){
            if(prices[i]<min_price){
                min_price=prices[i];
                min_date=i;
            }
            if(i>min_date&&prices[i]-min_price>max_profit)max_profit=prices[i]-min_price;
        }
        return max_profit;
    }
};


【Leetcode】Best Time to Buy and Sell Stock,布布扣,bubuko.com

【Leetcode】Best Time to Buy and Sell Stock

原文:http://blog.csdn.net/ussam/article/details/22292705

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!