intmaxProfit(vector<int>& prices){int sz = prices.size(), res =0;for(int i =1; i < sz;++i){if(prices[i]> prices[i -1])
res += prices[i]- prices[i -1];}return res;}
题意:有一组数组,第i个数表示第i天的股票价格,可以买卖任意次,问最多可以赚多少钱。思路:避免跌的情况即可。int maxProfit(vector&lt;int&gt;&amp; prices) { int sz = prices.size(), res = 0; for (int i = 1; i &lt; sz; ++i) { if (prices[i] &gt; pric...