Add solution #714

Author: JoshCrozier

README.md

@@ -326,6 +326,7 @@
 705|[Design HashSet](./0705-design-hashset.js)|Easy|
 706|[Design HashMap](./0706-design-hashmap.js)|Easy|
 713|[Subarray Product Less Than K](./0713-subarray-product-less-than-k.js)|Medium|
+714|[Best Time to Buy and Sell Stock with Transaction Fee](./0714-best-time-to-buy-and-sell-stock-with-transaction-fee.js)|Medium|
 717|[1-bit and 2-bit Characters](./0717-1-bit-and-2-bit-characters.js)|Easy|
 720|[Longest Word in Dictionary](./0720-longest-word-in-dictionary.js)|Medium|
 722|[Remove Comments](./0722-remove-comments.js)|Medium|

solutions/0714-best-time-to-buy-and-sell-stock-with-transaction-fee.js

@@ -0,0 +1,25 @@
+/**
+ * 714. Best Time to Buy and Sell Stock with Transaction Fee
+ * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
+ * Difficulty: Medium
+ *
+ * You are given an array prices where prices[i] is the price of a given stock on the ith day,
+ * and an integer fee representing a transaction fee.
+ *
+ * Find the maximum profit you can achieve. You may complete as many transactions as you like,
+ * but you need to pay the transaction fee for each transaction.
+ */
+
+/**
+ * @param {number[]} prices
+ * @param {number} fee
+ * @return {number}
+ */
+var maxProfit = function(prices, fee) {
+  let result = 0;
+  for (let i = 1, sell = -prices[0]; i < prices.length; i++) {
+    result = Math.max(result, sell + prices[i] - fee);
+    sell = Math.max(sell, result - prices[i]);
+  }
+  return result;
+};