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

    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(object):
        def maxProfit(self, prices):
            """
            :type prices: List[int]
            :rtype: int
            """
            # buy at lowest value, and sell it at highest
            if not prices: return 0
            ans = 0
            lowest = highest = prices[0]
            is_grow = False
            for i in xrange(1, len(prices)):
                if prices[i] > prices[i-1]:
                    highest = prices[i]
                    is_grow = True
                else:
                    if is_grow: # ^ point
                        ans += highest - lowest
                    lowest = prices[i]
                    is_grow = False
            if is_grow:
                ans += highest - lowest
            return ans                    

    直接绘图就知道上面解法和下面是等价的:

    就是贪心,看到涨就买进卖出!!!

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

    还有贪心的解法,先找到最低点,再找最高点:

    class Solution(object):
        def maxProfit(self, prices):
            """
            :type prices: List[int]
            :rtype: int
            """
            # buy at lowest value, and sell it at highest
            if not prices: return 0
            ans = 0
            i = 0
            length = len(prices)
            # 3 2 1
            # 1 2 3
            while i < length:
                while i<length-1 and prices[i]>=prices[i+1]: i += 1
                if i == length-1: break
                lowest = prices[i] 
                while i<length-1 and prices[i]<prices[i+1]: i += 1  
                ans += prices[i]-lowest #到这里,只能是i==length-1(也是因为一直涨到数组over) 或者是遇到了^转折点
                i += 1
            return ans                    
  • 相关阅读:
    vs2015 打开xaml:右击-打开方式->xml编辑器
    交互式计算机图形学(基于webGL)资源使用
    利用pushState开发无刷页面切换
    js 阻止冒泡 stopPropagation
    PHP中“简单工厂模式”实例讲解
    ajax传递特殊字符串问题 +%@
    GitHub自学
    ajax 请求超时 取消请求
    mongo操作之分页
    我使用过的Linux命令之date
  • 原文地址:https://www.cnblogs.com/bonelee/p/8660627.html
Copyright © 2011-2022 走看看