zoukankan      html  css  js  c++  java
  • Best Time to Buy and Sell Stock II

    /*
     *Best Time to Buy and Sell Stock II
    Say you have an array for which the ith element is the price of a given stock on day i.
    
    Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie,
    buy one and sell one share of the stock multiple times).
    However, you may not engage in multiple transactions at the same time (ie,
    you must sell the stock before you buy again).
    references:https://www.cnblogs.com/grandyang/p/4280803.html
    贪心法??
    */
    
    class Solution{
    public:
        int maxProfit(vector<int>& prices){
            int res = 0,n = prices.size();
            for(int i = 0; i < n - 1; ++i){
                if(prices[i] < prices[i+1]){
                    res += prices[i+1]-prices[i];
                }
            }
    
            return res;
        }
    };
    

      

    怕什么真理无穷,进一寸有一寸的欢喜。---胡适
  • 相关阅读:
    PHP自动加载(__autoload和spl_autoload_register)
    抽象工厂模式
    工厂方法模式
    简单工厂模式
    组合
    二叉树的层次遍历 II
    umask命令
    二叉树的所有路径
    CDN缓存的理解
    Js中RegExp对象
  • 原文地址:https://www.cnblogs.com/hujianglang/p/12427590.html
Copyright © 2011-2022 走看看