Best Time to Buy and Sell Stock

简介: Dynamic Programming Say you have an array for which the ith element is the price of a given stock on day i.

Dynamic Programming

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.

 

C++代码实现:

#include<iostream>
#include<vector>
using namespace std;

class Solution
{
public:
    int maxProfit(vector<int> &prices)
    {
        if(prices.empty())
            return 0;
        int buy=prices[0];
        int maxSum=0;
        int sum=0;
        int i;
        for(i=1;i<(int)prices.size();i++)
        {
            sum=prices[i]-buy;
            if(sum>maxSum)
                maxSum=sum;
            if(prices[i]<buy)
                buy=prices[i];
        }
        return maxSum;
    }
};

int main()
{
    Solution s;
    vector<int> vec={1,4,6,8,3,5,9,3,6};
    cout<<s.maxProfit(vec)<<endl;
}

 

相关文章
|
算法
LeetCode 121. Best Time to Buy and Sell Stock
给定一个数组,它的第 i 个元素是一支给定股票第 i 天的价格。 如果您最多只允许完成一笔交易(即买入和卖出一支股票),设计一个算法来计算你所能获取的最大利润。
81 0
LeetCode 121. Best Time to Buy and Sell Stock
|
算法
LeetCode 123. Best Time to Buy and Sell Stock III
给定一个数组,它的第 i 个元素是一支给定的股票在第 i 天的价格。 设计一个算法来计算你所能获取的最大利润。你最多可以完成 两笔 交易。 注意: 你不能同时参与多笔交易(你必须在再次购买前出售掉之前的股票)。
105 0
LeetCode 123. Best Time to Buy and Sell Stock III
|
算法
LeetCode 188. Best Time to Buy and Sell Stock IV
给定一个数组,它的第 i 个元素是一支给定的股票在第 i 天的价格。 设计一个算法来计算你所能获取的最大利润。你最多可以完成 k 笔交易。
88 0
LeetCode 188. Best Time to Buy and Sell Stock IV
Leetcode-Easy 121. Best Time to Buy and Sell Stock
Leetcode-Easy 121. Best Time to Buy and Sell Stock
127 0
Leetcode-Easy 121. Best Time to Buy and Sell Stock
1092. To Buy or Not to Buy (20) simple
#include using namespace std; int main(int argc, const char * argv[]) { // insert code here.
849 0