[Leetcode] 121. Best Time to Buy and Sell Stock 解题报告
2017-04-28 10:53
543 查看
题目:
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:
Example 2:
思路:
Easy级别的题目。我们记录一个截止当前日期的最低买入价,以及一个截止当前日期的最大获利,然后线性扫描数组,一旦发现当前卖出的获利大于最大获利值,则更新最大获利值;如果当前买入价小于最低买入价,则更新最低买入价。算法的时间复杂度是O(n),空间复杂度是O(1)。
代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) {
return 0;
}
int lowest_price = prices[0];
int max_profit = 0;
for (int i = 1; i < prices.size(); ++i) {
if (prices[i] - lowest_price > max_profit) {
max_profit = prices[i] - lowest_price;
}
if (prices[i] < lowest_price) {
lowest_price =prices[i];
}
}
return max_profit;
}
};
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.
思路:
Easy级别的题目。我们记录一个截止当前日期的最低买入价,以及一个截止当前日期的最大获利,然后线性扫描数组,一旦发现当前卖出的获利大于最大获利值,则更新最大获利值;如果当前买入价小于最低买入价,则更新最低买入价。算法的时间复杂度是O(n),空间复杂度是O(1)。
代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) {
return 0;
}
int lowest_price = prices[0];
int max_profit = 0;
for (int i = 1; i < prices.size(); ++i) {
if (prices[i] - lowest_price > max_profit) {
max_profit = prices[i] - lowest_price;
}
if (prices[i] < lowest_price) {
lowest_price =prices[i];
}
}
return max_profit;
}
};
相关文章推荐
- leetcode解题报告:121 Best Time to Buy and Sell Stock
- [leetcode] 121. Best Time to Buy and Sell Stock 解题报告
- Leetcode 121. Best Time to Buy and Sell Stock 股票买卖 解题报告
- 121. Best Time to Buy and Sell Stock (一) leetcode解题笔记
- LeetCode: Best Time to Buy and Sell Stock III 解题报告
- LeetCode解题报告—— Best Time to Buy and Sell Stock
- LeetCode-Best Time to Buy and Sell Stock-解题报告
- leetcode解题之121 # Best Time to Buy and Sell Stock
- leetcode解题报告:188 Best Time to Buy and Sell Stock IV
- 【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告
- LeetCode 121: Best Time to Buy and Sell Stock 解题与思考
- LeetCode-Best Time to Buy and Sell Stock IV -解题报告
- 【LeetCode】Best Time to Buy and Sell Stock 解题报告
- LeetCode-Best Time to Buy and Sell Stock II-解题报告
- [leetcode]解题报告121. Best Time to Buy and Sell Stock
- [leetcode] 188. Best Time to Buy and Sell Stock IV 解题报告
- LeetCode: Best Time to Buy and Sell Stock II 解题报告
- Leetcode 123. Best Time to Buy and Sell Stock III 股票买卖3 解题报告
- [Leetcode] 123. Best Time to Buy and Sell Stock III 解题报告
- [Leetcode] 188. Best Time to Buy and Sell Stock IV 解题报告