题目
题意
找到 max(nums[j] - nums[i]) , j > i && nums[j] > nums[i] max(nums[j] - nums[i]) , j > i && nums[j] > nums[i]
代码
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() <= 1) return 0;
int minp = prices[0], res = 0;
for (int i = 1; i < prices.size(); i++)
if (prices[i] > minp)
res = max(res, prices[i]-minp);
else
minp = prices[i];
return res;
}
};