leetcode刷题笔记 121.买卖股票的最佳时机【简单】

动态规划

int maxProfit(vector<int>& prices) {
	int minprice = INT_MAX;
	int maxprofit = 0;
	for (int p : prices) {
		minprice = min(minprice, p);
		maxprofit = max(maxprofit, p - minprice);
	}
	return maxprofit;
}