zoukankan      html  css  js  c++  java
  • LeetCode122: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).

    解题思路:

    这题与上一题Best Time to Buy and Sell Stock相比,其实还更简单,扫描一遍数组,当前前元素大于前一个元素,则将其差值累加到max中,最后求得的max即为最大利益。

    代码:

    #include <iostream>
    #include <vector>
    
    using namespace std;
    
    /**
    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).
    
    */
    
    class Solution {
    public:
        int maxProfit(vector<int> &prices) {
            if(prices.empty())
                return 0;
            int max = 0;
            for(int i = 1; i < prices.size(); i++)
            {
                if(prices[i] > prices[i-1])
                    max += prices[i] - prices[i-1];
            }
            return max;   
        }
    };
    
    int main(void)
    {
        int arr[] = {2,4,5,1,7,10};
        int n = sizeof(arr) / sizeof(arr[0]);
        vector<int> stock(arr, arr+n);
        Solution solution;
        int max = solution.maxProfit(stock);
        cout<<max<<endl;
        return 0;
        return 0;
    }
  • 相关阅读:
    java安全——BASE64
    Spring Aop 梳理
    Spring Aop中,获取被代理类的工具
    关于eclipse运行TestNG出现: CreateProcess error=206, ÎļþÃû»ò)չÃû的解决办法
    java内存设置
    用python开发调试器——起始篇
    5分钟破解全峰快递
    重拾黑客
    ThreadPoolExecutor的运转机制
    20190627_解决ADB的device offline问题的两种方法
  • 原文地址:https://www.cnblogs.com/mickole/p/3753820.html
Copyright © 2011-2022 走看看