714. Best Time to Buy and Sell Stock with Transaction Fee

题目

Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.

You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)

Return the maximum profit you can make.

Example 1:
Input: prices = [1, 3, 2, 8, 4, 9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
Buying at prices[0] = 1
Selling at prices[3] = 8
Buying at prices[4] = 4
Selling at prices[5] = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.

思路

使用动态规划。由小到大扫描。cash表示当前利润，hold表示股票持有价格（手中只能有一种股票），当比现在的cash值大，就卖。当遇到比持有的股票小，就换。注意，每次遇到比持有的股票小时，只是看中了，拿在手上，没有买。只有卖了，才会真正发生买的行为

代码

class Solution {
public:
    int maxProfit(vector<int>& prices, int fee) {
        int cash = 0;int hold = -prices[0];
        for (int i = 1; i < prices.size(); i++) {
            cash = max(cash, hold + prices[i] - fee);
            hold = max(hold, cash - prices[i]);
        }
        return cash;
    }
    int max(int a,int b) {
        if(a>b) return a;
        return b;
    }
};