【leetcode】122.Best Time to Buy and Sell Stock II

小do在努力

于 2015-07-19 21:23:23 发布

阅读量833

点赞数

分类专栏：【leetcode】文章标签： leetcode dp 动态规划

本文链接：https://blog.csdn.net/zone_programming/article/details/46958519

版权

【leetcode】专栏收录该内容

53 篇文章

订阅专栏

@requires_authorization
@author johnsondu
@create_time 2015.7.19 21:01
@url [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)
/************************
 * @description: dynamic programming.
 *    相邻元素做差，求出所有非负元素的和
 * @time_complexity:  O(n)
 * @space_complexity: O(1)
 ************************/
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int p_size = prices.size();
        if(p_size < 2) return 0;
        int ans = 0;
        for(int i = 1; i < p_size; i ++) {
            int tmp = prices[i] - prices[i-1];
            if(tmp > 0) ans += tmp;
        }
        return ans;
    }
};