comefrom: <gouthampradhan>dynamic_programming_BestTimeToBuyAndSellStocksWithFee_1.java
code: public int maxProfit(int[] prices, int fee) {
      int cash = 0, stock = -prices[0];
      for (int i = 1; i < prices.length; i++) {
        cash = Math.max(cash, prices[i] + stock - fee);
        stock = Math.max(stock, cash - prices[i]);
      }
      return cash;
    }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int var_3 = 0 , var_4 = - var_0 [ 0 ] ;
    for ( int var_6 = 1 ;
    var_6 < var_0 . length ;
    var_6 ++ ) {
      var_3 = Math . max ( var_3 , var_0 [ var_6 ] + var_4 - var_1 ) ;
      var_4 = Math . max ( var_4 , var_3 - var_0 [ var_6 ] ) ;
    }
    return var_3 ;
  }
  