By doing this problem i now understand that there are two things i need to focus on DP and recursion or else ill get fucked in life, true moments

Author: ChSatyaSavith

714. Best Time to Buy and Sell Stock with Transaction Fee.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int aheadBuy = 0;
+    int aheadNotBuy = 0;
+
+    int curBuy,curNotbuy;
+    int maxProfit(vector<int>& prices, int fee) 
+    {
+        for(int i = prices.size()-1;i>=0;i--)
+        {
+            curBuy = max(-prices[i]+aheadNotBuy,0+aheadBuy);
+            curNotbuy = max(prices[i]+aheadBuy-fee,0+aheadNotBuy);
+
+            aheadBuy = curBuy;
+            aheadNotBuy = curNotbuy;
+        }
+        return aheadBuy;
+    }
+};