# Des

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.

# 分析

``````class Solution {
public:
int max1(vector<int>& prices,int i){
int maxp=-1000;
for(;i<prices.size();i++){
if(prices[i]>maxp)
maxp=prices[i];
}
return maxp;
}
int min1(vector<int>& prices,int i){
int minp=1000;
for(int j=0;j<=i;j++){
if(prices[j]<minp)
minp=prices[i];
}
return minp;
}
int maxProfit(vector<int>& prices) {
int maxp=-1000;
for(int i=0;i<prices.size();i++){
if((max1(prices,i) - min1(prices,i)) > maxp)
maxp=(max1(prices,i)-min1(prices,i));
}
return maxp;
}
};``````

# Code

``````class Solution {
public:
int maxProfit(vector<int>& prices) {
int ans=-1,res=0;
for(int i=prices.size()-1;i>=0;i--){
ans=max(ans,prices[i]);
res=max(res,ans-prices[i]);
}
return res;
}
};``````

• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode 121. Best Time to Buy and Sell Stock 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)