Middle-题目4:122. Best Time to Buy and Sell Stock II

原创 2016年05月31日 15:25:14

题目原文:
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).
题目大意:
已知一个数组,第i个元素代表一支股票第i天的价格。设计一个算法,求出买卖这只股票的最大利润。你可以任意的买卖,但每天只能进行一个操作。
题目分析:
贪心算法,因为最优的操作是在最低值点买,最高值点卖,所以只要后一天比前一天价格高,就加到利润里面。
源码:(language:java)

public class Solution {
    public int maxProfit(int[] prices) {
        int profit=0;
        int l=prices.length-1;
        for(int i=0;i<l;i++) {
            if(prices[i+1]>=prices[i])  
                profit+=prices[i+1]-prices[i];
        }
        return profit; 
    }
}

成绩:
2ms,beats 15.31%,众数2ms,76.17%
Cmershen的碎碎念:
一开始想到的是模拟买卖过程,用一个布尔形变量表示有没有股票,如果有股票,且“明天”价格比“今天”低,则卖掉,maxProfit加上今天股价,反之买入,maxProfit减今天股价。但其实本质是一样的,上述算法更为简洁。

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

相关文章推荐

[Leetcode]122. Best Time to Buy and Sell Stock II

122. Best Time to Buy and Sell Stock IISay you have an array for which the i-th element is the price...

LeetCode122 Best Time to Buy and Sell Stock II

详细见:leetcode.com/problems/best-time-to-buy-and-sell-stock-ii Java Solution: github package l...

LeetCode题解:122. Best Time to Buy and Sell Stock II

题目链接:122. Best Time to Buy and Sell Stock II题目描述: Say you have an array for which the ith element ...

算法设计Week5 LeetCode Algorithms Problem #122 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. ...

LeetCode121/122/123/188 Best Time to Buy and Sell Stock<股票> I/II/III/IIII----DP+Greedy**

一:LeetCode 121 Best Time to Buy and Sell Stock 题目: Say you have an array for which the ith element...

LeetCode122. Best Time to Buy and Sell Stock II题解

今天讨论一道让我想的过于复杂的题目:一道有关股票买卖的问题。题目描述:Say you have an array for which the i th element is the price of ...

leetcode_[python/C++]_121/122/123/188.Best Time to Buy and Sell Stock I/II/III/IV

121. Best Time to Buy and Sell Stock [题目] Say you have an array for which the ith element is the p...

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 a...

LeetCode 122. Best Time to Buy and Sell Stock II 解题报告

LeetCode 122. Best Time to Buy and Sell Stock II 解题报告

Leetcode 122 . 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. Desig...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)