solve problem Best Time To Buy And Sell Stock With Transaction Fee

Author: P-ppc

README.md

@@ -97,6 +97,7 @@ All solutions will be accepted!
 |696|[Count Binary Substrings](https://leetcode-cn.com/problems/count-binary-substrings/description/)|[java/py/js](./algorithms/CountBinarySubstrings)|Easy|
 |121|[Best Time To Buy And Sell Stock](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/description/)|[java/py/js](./algorithms/BestTimeToBuyAndSellStock)|Easy|
 |122|[Best Time To Buy And Sell Stock II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/)|[java/py/js](./algorithms/BestTimeToBuyAndSellStockII)|Easy|
+|714|[Best Time To Buy And Sell Stock With Transaction Fee](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/)|[java/py/js](./algorithms/BestTimeToBuyAndSellStockWithTransactionFee)|Medium|
 |599|[Minimum Index Sum Of Two Lists](https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/description/)|[java/py/js](./algorithms/MinimumIndexSumOfTwoLists)|Easy|
 |551|[Student Attendance Record I](https://leetcode-cn.com/problems/student-attendance-record-i/description/)|[java/py/js](./algorithms/StudentAttendanceRecordI)|Easy|
 |538|[Convert Bst To Greater Tree](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/description/)|[java/py/js](./algorithms/ConvertBstToGreaterTree)|Easy|

algorithms/BestTimeToBuyAndSellStockWithTransactionFee/README.md

@@ -0,0 +1,2 @@
+# Best Time To Buy And Sell Stock With Transaction Fee
+We can solve this problem by Greedy Algorithm

algorithms/BestTimeToBuyAndSellStockWithTransactionFee/Solution.java

@@ -0,0 +1,30 @@
+class Solution {
+    public int maxProfit(int[] prices, int fee) {
+        if (prices.length == 0)
+            return 0;
+    
+        int maxProfit = 0,
+            holder = prices[0],
+            maxPrice = prices[0];
+
+        for (int i = 1; i < prices.length; i++) {
+            int price = prices[i];
+
+            if (price > maxPrice)
+                maxPrice = price;
+            else if (maxPrice - price >= fee) {
+                if (maxPrice - holder > fee)
+                     maxProfit += maxPrice - holder - fee;
+                holder = price;
+                maxPrice = price;
+            } else if (price < holder) {
+                holder = price;
+                maxPrice = price;
+            }
+        }
+
+        if (maxPrice - holder > fee)
+            maxProfit += maxPrice - holder - fee;
+        return maxProfit;
+    }
+}

algorithms/BestTimeToBuyAndSellStockWithTransactionFee/solution.js

@@ -0,0 +1,33 @@
+/**
+ * @param {number[]} prices
+ * @param {number} fee
+ * @return {number}
+ */
+var maxProfit = function(prices, fee) {
+    if (prices.length == 0)
+        return 0
+    
+    let maxProfit = 0,
+        holder = prices[0],
+        maxPrice = prices[0]
+    
+    for (let i = 1; i < prices.length; i++) {
+        let price = prices[i]
+        
+        if (price > maxPrice)
+            maxPrice = price
+        else if (maxPrice - price >= fee) {
+            if (maxPrice - holder > fee)
+                 maxProfit += maxPrice - holder - fee
+            holder = price
+            maxPrice = price
+        } else if (price < holder) {
+            holder = price
+            maxPrice = price
+        }
+    }
+    
+    if (maxPrice - holder > fee)
+        maxProfit += maxPrice - holder - fee
+    return maxProfit
+};

algorithms/BestTimeToBuyAndSellStockWithTransactionFee/solution.py

@@ -0,0 +1,31 @@
+class Solution(object):
+    def maxProfit(self, prices, fee):
+        """
+        :type prices: List[int]
+        :type fee: int
+        :rtype: int
+        """
+        if len(prices) == 0:
+            return 0
+        
+        holder = prices[0]
+        max_price = prices[0]
+        max_profit = 0
+        
+        for i in xrange(1, len(prices)):
+            price = prices[i]
+            if price > max_price:
+                max_price = price
+            elif max_price - price >= fee:
+                if max_price - holder - fee > 0:
+                    max_profit += max_price - holder - fee
+                holder = price
+                max_price = price
+            elif price < holder:
+                holder = price
+                max_price = price
+                
+        if max_price - holder > fee:
+            max_profit += max_price - holder - fee
+        return max_profit
+