<medium>LeetCode Problem -- 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.

• 描述：分析股票的最大收益，给出一个数组，数组的下标代表天数，数组数字代表股票价格，要求在买入股票之时手中不能有股票，并且要为每次交易行为付出交易费。
• 思路一：这样的要求找最大收益的题目基本用动态规划来解决，在一天时间中可以发生如下两种情况：
  1.手中没有股票
  a.仍然不买入股票（无收益，无支出）sold[i] = sold[i - 1]
  b.在这天卖出股票（hold[i - 1] + prices[i] - fee）
  2.手中有股票
  a.仍然持有股票（无收益，无支出）hold[i] = hold[i - 1]
  b.在这天买入股票（sold[i-1] - prices[i]）

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