题解 | #牛群买卖策略优化#
牛群买卖策略优化
https://www.nowcoder.com/practice/c8514318443a48218efde630ae11b4c3
class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param prices int整型vector * @return int整型 */ int max_profitv2(vector<int>& prices) { // write code here int ans = 0; for (int i = 1; i < prices.size(); i++) { if (prices[i] > prices[i-1]) { ans += (prices[i]-prices[i-1]); } } return ans; } };