leetcode - 123. 买卖股票的最佳时机 III

#include 
#include 
using namespace std;


int maxProfit(vector& prices) {
	int n = prices.size();
	if(n < 2){
		return 0;
	} 
	int buy1 = -prices[0], sell1 = 0;
	int buy2 = -prices[0], sell2 = 0;
	for(int i = 1; i < n; i++){
		buy1 = max(buy1, -prices[i]);
		sell1 = max(sell1, buy1 + prices[i]);
		buy2 = max(buy2, sell1 - prices[i]);
		sell2 = max(sell2, buy2 + prices[i]);
	}
	return max(sell1, sell2);
}

int main(){
	int n, res;
	cin>>n;
	vector prices(n);
	for(int i = 0; i < n; i++){
		cin>>prices[i];
	}
	res = maxProfit(prices);
	cout<