121. Best Time to Buy and Sell Stock
Description:
Say you have an array for which the
i
t
h
i^{th}
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.
Difficulty:Easy
Example:
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.
Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.
方法1:One Pass
- Time complexity : O ( n ) O\left ( n \right ) O(n)
- Space complexity :
O
(
1
)
O\left ( 1 \right )
O(1)
思路:
寻找最小价格,更新的买入点才有可能达到最大利润,有超过历史最大利润时更新最大利润。
class Solution {
public:
int maxProfit(vector<int>& prices) {
int min_price = INT_MAX;
int max_profit = 0;
for (int i = 0; i < prices.size(); i++) {
if (prices[i] < min_price) {
min_price = prices[i];
}
else if(prices[i] - min_price > max_profit){
max_profit = prices[i] - min_price;
}
}
return max_profit;
}
};