【第21期】观点:人工智能到底用 GPU?还是用 FPGA?

LeetCode 121. Best Time to Buy and Sell Stock

原创 2016年05月31日 22:05:57

Best Time to Buy and Sell Stock

Des

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**3了,太怕。

class Solution {
public:
    int max1(vector<int>& prices,int i){
        int maxp=-1000;
        for(;i<prices.size();i++){
            if(prices[i]>maxp)
                maxp=prices[i];
        }
        return maxp;
    }
    int min1(vector<int>& prices,int i){
        int minp=1000;
        for(int j=0;j<=i;j++){
            if(prices[j]<minp)
                minp=prices[i];
        }
        return minp;
    }
    int maxProfit(vector<int>& prices) {
        int maxp=-1000;
        for(int i=0;i<prices.size();i++){
            if((max1(prices,i) - min1(prices,i)) > maxp)
                maxp=(max1(prices,i)-min1(prices,i));
        }
        return maxp;
    }
};

自己写的也能work,这也算不赖了,但是有些情况会超时,并且题是easy的不应该有这么多代码,可是自己真没什么思路了。

别人处理的方法

首先从后往前找,边找出最大的卖出值,边求最大的卖出价,这个题的code真的觉得很精妙。

Code

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int ans=-1,res=0;
        for(int i=prices.size()-1;i>=0;i--){
            ans=max(ans,prices[i]);
            res=max(res,ans-prices[i]);
        }
        return res;
    }
};
版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

LeetCode121 Best Time to Buy and Sell Stock

详细见:leetcode.com/problems/best-time-to-buy-and-sell-stock Java Solution: github package leet...

188 Best Time to Buy and Sell Stock IV——leetcode

  class Solution { public: Solution(){} int maxProfit(int K, vector&lt;int&gt; &amp;prices) { vector&lt;int&gt; lowVec; vector&lt;int &gt; highVec; if(pric

LeetCode121/122/123/188 Best Time to Buy and Sell Stock<股票> I/II/III/IIII----DP+Greedy**

一:LeetCode 121 Best Time to Buy and Sell Stock 题目: Say you have an array for which the ith element...

LeetCode - 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 da

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...
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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