https://leetcode.com/contest/leetcode-weekly-contest-55/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
[Implementation idea]: 1. native way O(n^2) 2. fast O(n) result Ans 1 = 309432285 spent = 13.226000 sec Ans 2 = 309432285 spent = 0.000000 sec 請按任意鍵繼續 . . . #include<vector> #include<iostream> #include<stdio.h> #include <stdlib.h> #include <time.h> using namespace std; class Solution { public: int maxProfit(vector<int>& prices, int fee) { if (prices.size() < 2) return 0; vector<int> bestFromNow(prices.size(), 0); int best = 0; int last = (prices.size() - 1); bestFromNow[last] = 0; for (int i = (last - 1); i >= 0; i--) { for (int j = i + 1; j < prices.size(); j++) { int feeNow = (prices[j] - prices[i] + bestFromNow[j]) - fee; if (feeNow > best) { best = feeNow; } } bestFromNow[i] = best; } return bestFromNow[0]; } i...