买股票最佳时期
方法一:暴力法
class Solution {public: int maxProfit(vector<int>& prices) {
int max=INT_MIN;
int sum=0;
int len=int(prices.size());
if(len<2)
return 0;
for(int i=0;i++;i<len)
{ for(int j=i+1;j++;j<len)
{
if(prices[j]>prices[i])
{
sum=prices[j]-prices[i];
if(max<sum)
{
max=sum;
}
} }
}
return sum; }};
方法二:动态规划
class Solution {public: int maxProfit(vector<int>& prices) {
int res = 0;
int min_val = INT_MAX;
for (int i = 0; i < prices.size(); i++)
{
min_val = min(min_val, prices[i]);
res = max(res, prices[i] - min_val);
} return res;
}
};