[Problem]
[Solution]
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.
[Solution]
class Solution {说明:版权所有,转载请注明出处。 Coder007的博客
public:
int maxProfit(vector<int> &prices) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int minPrice = INT_MAX, maxProfit = 0;
for(int i = 0; i < prices.size(); ++i){
if(i == 0){
minPrice = prices[i];
}
else{
maxProfit = max(maxProfit, prices[i] - minPrice);
minPrice = min(minPrice, prices[i]);
}
}
return maxProfit;
}
};