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

题解：简单的动态规划题。用prices存储每天的股票价格，dp[i]表示第i天的最大利润，minmum表示遍历到当前为止prices中最小的元素。

那么在第i+1天有两种选择：

1.在这一天卖掉股票，那么显然可以获得的最大利润是prices[i+1]-minmum；

2.在这一天之前就把股票卖掉，那么可以获得的最大利润即使前i天可以获得最大利润。

dp[i] = max({dp[0],dp[1],...,dp[i]},prices[i+1]-minmum)

其实上述的dp数组也不需要，只要一个profit变量记录到当前为止可以获得最大的利润就可以了。

代码如下：

#include <iostream>
#include <vector>
using namespace std;class Solution {
public:int maxProfit(vector<int> &prices) {if(prices.size() == 0)return 0;int Profit = 0;int minmum_price = prices[0];for(int i= 1;i < prices.size();i++){if(prices[i] < minmum_price)minmum_price = prices[i];if(prices[i]-minmum_price > Profit)Profit = prices[i]-minmum_price;}return Profit;}
};int main(){vector <int> prices;prices.push_back(3);prices.push_back(3);prices.push_back(5);prices.push_back(0);prices.push_back(0);prices.push_back(3);prices.push_back(1);prices.push_back(4);Solution s;cout <<s.maxProfit(prices)<<endl;
}

JAVA版本代码：设置一个最小值记录当前为止最低的价格，一个answer变量记录当前为止可以获得最大收益，那么在每一步answer = max(answer,prices[i]-nowMin),最后的answer就是最大的收益。

 1 public class Solution {
 2     public int maxProfit(int[] prices) {
 3         int nowMin = Integer.MAX_VALUE;
 4         int answer = 0;
 5         for(int i = 0;i < prices.length;i++){
 6             nowMin = nowMin < prices[i]?nowMin:prices[i];
 7             answer = answer > prices[i]-nowMin?answer:prices[i]-nowMin;
 8         }
 9         return answer;
10     }
11 }

转载于:https://www.cnblogs.com/sunshineatnoon/p/3732428.html

【leetcode】Best Time to Buy and Sell Stock相关推荐

【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告
原文地址:http://liangjiabin.com/blog/2015/04/leetcode-best-time-to-buy-and-sell-stock.html Best Time to ...
【CODE】Best Time to Buy and Sell Stock
买卖股票问题:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/solution/yi-ge-tong-yong ...
【leetcode】best time to buy and sell stocks(i, ii, iii, iv, v)
i.只允许一次交易思路:从前向后遍历数组,记录当前出现过的最低价格,作为买入价格,并计算以当天价格出售的收益,作为可能的最大收益,整个遍历过程中,出现过的最大收益就是所求. class Soluti ...
leetcode【121】Best Time to Buy and Sell Stock【c++，O(n)复杂度，时间97%，空间100%】
问题描述: Say you have an array for which the ith element is the price of a given stock on day i. If you ...
【DP + 卖股票】LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee
LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee Solution1: 参考网址:http://www.cnblog ...
【DP + 卖股票】LeetCode 309. Best Time to Buy and Sell Stock with Cooldown
LeetCode 309. Best Time to Buy and Sell Stock with Cooldown Solution1: 比较有难度的一道动态规划题了! 参考网址:http://z ...
【DP + 卖股票】LeetCode 188. Best Time to Buy and Sell Stock IV
LeetCode 188. Best Time to Buy and Sell Stock IV Solution1:我的答案参考链接:http://www.cnblogs.com/grandyan ...
【DP + 卖股票】LeetCode 123. Best Time to Buy and Sell Stock III
LeetCode 123. Best Time to Buy and Sell Stock III Solution1: 不得不让人感叹算法之精妙啊!!! 参考网址:[1]http://www.cnb ...
【贪心和 DP + 卖股票】LeetCode 122. Best Time to Buy and Sell Stock II
LeetCode 122. Best Time to Buy and Sell Stock II Solution1:我的答案贪心和DP傻傻分不清! class Solution { public: ...

【leetcode】Best Time to Buy and Sell Stock

【leetcode】Best Time to Buy and Sell Stock相关推荐

最新文章

热门文章