Middle-题目4: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.
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 https://blog.csdn.net/cmershen/article/details/51546106
个人分类: Leetcode
上一篇Middle-题目3:238. Product of Array Except Self
下一篇Middle-题目5:319. Bulb Switcher
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭