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 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.

其实就是在一个数组当中找到最大的差值,较大的值在小值后面

常规的想法就是一个二维的循环,从当前值开始向后遍历一遍获得最大值,但是这样的时间复杂度是o(n2)

其实主要是因为要求最大值在后面,所以其实可以从后面向前面进行遍历,记录插值最大,而且一直记录最大值

class Solution {
public:
    int maxProfit(vector<int> &prices) {
   if(prices.size()==0||prices.size()==1)
            return 0;
        int max = prices[prices.size()-1];
        int re = 0;
        for(int i = prices.size()-2; i >= 0; i--)
        {
            int value = max-prices[i];
            if(value > re)
            {
                re = value;
            }
            if(prices[i] > max)
            {
                max = prices[i];
            }
        }
        return re;
    }
};

或者从前面开始记录最小值也是可以的:

class Solution {
public:
    int maxProfit(vector<int> &prices) {
   if(prices.size()==0||prices.size()==1)
            return 0;
        int min = prices[0];
        int re = 0;
        for(int i = 1; i<prices.size(); i++ )
        {
            int value = prices[i]-min;
            if(value > re)
            {
                re = value;
            }
            if(prices[i] < min)
            {
                min = prices[i];
            }
        }
        return re;
    }
};
时间: 2024-10-20 10:43:14

LeetCode—Best Time to Buy and Sell Stock的相关文章

leetcode——Best Time to Buy and Sell Stock III 买卖股票最大收益(AC)

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may not engage in multiple transactions at the same time (ie,

LeetCode: Best Time to Buy and Sell Stock II [122]

[题目] Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times

LeetCode: Best Time to Buy and Sell Stock III [123]

[题目] Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may not engage in multiple transactions at the same time

[leetcode]_Best Time to Buy and Sell Stock I &amp;&amp; II

一个系列三道题,我都不会做,google之答案.过了两道,第三道看不懂,放置,稍后继续. 一.Best Time to Buy and Sell Stock I 题目:一个数组表示一支股票的价格变换.要求只买卖一次,获得最大收益. 思路:一开始我认为是寻找最大.最小值,但由于最大值不一定总是出现在最小值的后面,因此WA. 参考思路:DP.对第i个价格,减去前i-1个价格中的最小值(保证该收益是在第i个价格卖出的最大收益),其收益与之前获得的最大收益相比. 代码: 1 public int max

LeetCode: Best Time to Buy and Sell Stock [121]

[题目] 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.

LeetCode——Best Time to Buy and Sell Stock III

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may not engage in multiple transactions at the same time (ie,

LeetCode Best Time to Buy and Sell Stock with Cooldown

原题链接在这里:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/ 题目: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many

LeetCode Best Time to Buy and Sell Stock with Transaction Fee

原题链接在这里:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/ 题目: Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee 

LeetCode Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock II Total Accepted: 41127 Total Submissions: 108434 My Submissions Question Solution Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit

[LeetCode]Best Time to Buy and Sell Stock III 动态规划

本题是Best Time to Buy and Sell Stock/的改进版. 本题中,可以买最多买进卖出两次股票. 买两次股票可以看成是第0~i天买进卖出以及第i+1~n-1天买进卖出两部分.这要枚举i并求出0th~ith的最大利益与(i+1)th~(n-1)th的最大利益之和的最大值就是买进卖出两次可以得到的最大利益.即状态转移方程: dp[0,n-1]=max{dp[0,k]+dp[k+1,n-1]},k=1,...,n-2 而只买进卖出一次的最大利润通过0th~ith可以求得. 这里求