leetcode-121. 买卖股票的最佳时机
题目:
代码:
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int maxProfit(vector<int>& prices) {
int res=0;
int n=prices.size();
int min=pow(2,32)-1;
for(int i=0;i<n;i++){
res=res>prices[i]-min?res:prices[i]-min;
min=min<prices[i]?min:prices[i];
}
return res;
}
int main(){
int res;
vector<int> prices;
int n,tn;
cin>>n;
for(int i=0;i<n;i++){
cin>>tn;
prices.push_back(tn);
}
res=maxProfit(prices);
cout<<res;
return 0;
}