码迷,mamicode.com
首页 > 其他好文 > 详细

Best Time to Buy and Sell Stock

时间:2014-05-30 16:30:00      阅读:282      评论:0      收藏:0      [点我收藏+]

标签:des   c   style   class   blog   code   

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.

bubuko.com,布布扣
class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int len=prices.size();
        if(len<=1) return 0;
        
        int low[len];
        low[0]=prices[0];
        for(int i=1;i<len;i++)
        {
            if(prices[i]<low[i-1])
                low[i]=prices[i];
            else
                low[i]=low[i-1];
        }
        
        int max=0;
        for(int i=1;i<len;i++)
        if(prices[i]-low[i-1]>max)
            max=prices[i]-low[i-1];
        
        return max;
    }
};
bubuko.com,布布扣

 

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

Best Time to Buy and Sell Stock

标签:des   c   style   class   blog   code   

原文地址:http://www.cnblogs.com/erictanghu/p/3759661.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!