题目:
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.
解释:
只可以完成一次交易(在某天买入然后在某天卖出),求最大利益。
用两个变量在一次遍历中记住当前最小的价格和最大的利润,最后返回最大利润。
python代码:
class Solution(object):
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
min_price=10000
max_profit=0
for price in prices:
min_price=min(min_price,price)
max_profit=max(max_profit,price-min_price)
return max_profit
c++代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
int min_price=INT_MAX;
int max_profit=0;
for (auto price:prices)
{
min_price=min(min_price,price);
max_profit=max(max_profit,price-min_price);
}
return max_profit;
}
};
总结:
不要写一些无意义的判断条件,白白浪费时间。