classSolution(object): defmaxProfit(self, prices, fee): """ :type prices: List[int] :type fee: int :rtype: int """ n = len(prices) if n < 2: return0 ans, minimum = 0, prices[0] for i in xrange(1, n): if prices[i] < minimum: minimum = prices[i] elif prices[i] > minimum + fee: ans += prices[i] - fee - minimum minimum = prices[i] - fee return ans