今天听说计科的同学作业有这道题,就顺便做了一下。感觉好像在去年新手赛里见过,应该是第一题。
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
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 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.
Example 1:
Input: [7, 1, 5, 3, 6, 4] Output: 5 max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1] Output: 0 In this case, no transaction is done, i.e. max profit = 0.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
题解:
本题是给了一个vector,里面存有每一天的股票价格,要求哪天买入哪天卖出能获得最大的利润。也就是说,需要求出两个数最大的差值,且较小的数字在较大的数字前面。
刚开始想的比较简单,认为只需要找出一个最小值并在它后面的元素中找出最大值即可,但后来仔细一想,以[3, 5, 6, 7, 1, 2]为例,按照我之前的想法得出的答案是1(1买2卖),而正确答案应该是4(3买7卖)。后来试了简单粗暴的直接双重循环找最小,需要O(n²)的复杂度,于是就超时了。想了很久才想到要先找出当前最小值并在循环的时候将现价与当前最小值相减得到的数字与当前最大利润进行比较。最后提交的时候由于测试例子里面给了空vector的情况,而我的代码中有将第一个元素设为最小的语句于是出了run time error,因此最后在前面加了一句if判断vector是否为空,但感觉实际上并不必要。
代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0)
return 0;
else
{
int profit = 0;
int min = prices[0];
for (int i = 1; i < prices.size(); i++)
{
if (min > prices[i])
min = prices[i];
if (profit < prices[i] - min)
profit = prices[i] - min;
}
return profit;
}
}
};