最低位买入,最高位卖出。记录下买入的最低位,每到一个位置比较下,时间复杂度O(N)
class Solution {
public:
int maxProfit(vector<int>& prices) {
int n = prices.size();
int profict = 0, purchase = INT_MAX;
for(int i=0;i<n;i++){
purchase = min(prices[i],purchase);
profict = max(profict,prices[i]-purchase);
}
return profict;
}
};