假设你有一个数组,它的第i个元素是一支给定的股票在第i天的价格。设计一个算法来找到最大的利润。你最多可以完成两笔交易。
样例
给出一个样例数组 [4,4,6,1,1,4,2,5], 返回 6
#ifndef C151_H
#define C151_H
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
class Solution {
public:
/**
* @param prices: Given an integer array
* @return: Maximum profit
*/
int maxProfit(vector<int> &prices) {
// write your code here
int len = prices.size();
if (len <= 0)
return 0;
vector<int> left(len);
vector<int> right(len);
int count = INT_MIN;
left[0] = 0;
for (int i =1; i <len; ++i)
{
if (left[i - 1] >= 0)
left[i] = left[i - 1] + prices[i] - prices[i - 1];
else
left[i] = prices[i] - prices[i - 1];
}
for (int i = 1; i < len; ++i)
{
left[i] = left[i]>left[i - 1] ? left[i] : left[i - 1];
}
right[len - 1] = 0;
for (int j = len - 2; j >= 0; --j)
{
if (right[j + 1] >= 0)
right[j] = right[j + 1] + prices[j + 1] - prices[j];
else
right[j] = prices[j + 1] - prices[j];
}
for (int j = len - 2; j >= 0; --j)
{
right[j] = right[j] > right[j + 1] ? right[j] : right[j + 1];
}
for (int k = 0; k < len; ++k)
{
count = count>left[k] + right[k] ? count : left[k] + right[k];
}
return count;
}
};
#endif