refactor 714

fishercoder1534 · fishercoder1534 · commit 8748a21d40f0 · 2020-07-22T12:40:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_714.java b/src/main/java/com/fishercoder/solutions/_714.java
@@ -1,37 +1,12 @@
 package com.fishercoder.solutions;
 
-/**
- * 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.
-
- Note:
- 0 < prices.length <= 50000.
- 0 < prices[i] < 50000.
- 0 <= fee < 50000.
- */
 public class _714 {
     public static class Solution1 {
-        /**O(n) time
+        /**
+         * O(n) time
          * O(n) space
          * credit: https://discuss.leetcode.com/topic/108009/java-c-clean-code-dp-greedy
-         * */
+         */
         public int maxProfit(int[] prices, int fee) {
             int n = prices.length;
             if (n < 2) {
@@ -49,17 +24,18 @@ public int maxProfit(int[] prices, int fee) {
     }
 
     public static class Solution2 {
-        /**O(n) time
+        /**
+         * O(n) time
          * O(1) space
          * credit: https://leetcode.com/articles/best-time-to-buy-and-sell-stock-with-transaction-fee/
-         *
+         * <p>
          * cash: the max profit we could have if we did not have a share of stock in hand
          * hold: the max profit we could have if we hold one share of stack in hand
-         *
+         * <p>
          * to transition from the i-th day to the i+1 th day, we have two options:
          * 1. sell our stock: cash = Math.max(cash, hold + prices[i] - fee)
          * 2. buy a stock: hold = Math.max(hold, cash - prices[i])
-         * */
+         */
         public int maxProfit(int[] prices, int fee) {
             int cash = 0;
             int hold = -prices[0];
