| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/feixiangcode/algorithm/master/Week_04/id_150/Leetcode_563_150.cpp | [Back] [Original] |
class Solution {
public:
int maxProfit(vector& prices, int fee) {
if(prices.size() == 1)
return 0;
int buy = prices[0];
int money = 0;
for(int i = 1; i < prices.size(); i++) {
if((prices[i] - buy) > fee) {
cout
| Web Proxy Viewer | New URL | Original Page |