class Solution {
public:
int maxProfit(vector<int> &prices) {
if ( prices.size() < 2 ) return 0;
int min,profit=0;
min = prices[0];
for (int i = 0; i < prices.size(); i++)
{
if (prices[i]<min)
min = prices[i];
else if(prices[i]-min > profit)
profit = prices[i]-min;
}
return profit;
}
};
public:
int maxProfit(vector<int> &prices) {
if ( prices.size() < 2 ) return 0;
int min,profit=0;
min = prices[0];
for (int i = 0; i < prices.size(); i++)
{
if (prices[i]<min)
min = prices[i];
else if(prices[i]-min > profit)
profit = prices[i]-min;
}
return profit;
}
};