121. Best Time to Buy and Sell Stock
Difficulty: Easy
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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note that you cannot sell a stock before you buy one.
Example 1:
Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.
Solution
思路
保存最小的股价minPrice
,遍历,计算当前的股价prces[i]
减去最小股价minPrice
的收益,和最大maxPro
比较,更新最大的maxPro
。时间复杂度
O
(
N
)
O(N)
O(N)。
Language: C++
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.empty()) return 0;
int minPrice = INT_MAX, maxPro = 0;
for (int i = 0; i < prices.size(); i++){
minPrice = min(prices[i], minPrice);
maxPro = max(maxPro, (prices[i] - minPrice));
}
return maxPro;
}
};