声明:原题目转载自LeetCode,解答部分为原创
Problem :
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.
Solution :
思路:找到数组中 array[i] - array[j] 的最大值,其中 i >= j
代码如下:
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.empty())
return 0;
int max_to_pro;
int min_to_buy;
max_to_pro = 0;
min_to_buy = prices[0];
for(int i = 0; i < prices.size(); i++)
{
if(min_to_buy > prices[i])
{
min_to_buy = prices[i];
}
if(max_to_pro < prices[i] - min_to_buy)
{
max_to_pro = prices[i] - min_to_buy;
}
}
return max_to_pro;
}
};
int main()
{
vector<int> prices;
prices.push_back(2);
prices.push_back(4);
prices.push_back(1);
Solution text;
cout << text.maxProfit(prices) << endl;
return 0;
}