本文共 296 字,大约阅读时间需要 1 分钟。
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function //sum all the consecutive positive diff int sum = 0; for (int i = 1; i < prices.size(); ++i) sum += max(0, prices[i]-prices[i-1]); return sum; }};
转载地址:http://uoxti.baihongyu.com/