【LeetCode】【Python解决问题的方法】Best Time to Buy and Sell Stock II
2015-10-26 15:33
633 查看
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天的价格,你能够买卖股票,无需考虑手上的钱够买多少股,题目意思是能够随便买卖。但要买就买一股,不卖出这一股是无法再次买入的。这题非常easy。第二天比今天价格高了就买入,低了就卖出就可以
思路:遍历数组,计算全部第二天比前一天价格高的值,加起来就是最后的最大收益。
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天的价格,你能够买卖股票,无需考虑手上的钱够买多少股,题目意思是能够随便买卖。但要买就买一股,不卖出这一股是无法再次买入的。这题非常easy。第二天比今天价格高了就买入,低了就卖出就可以
思路:遍历数组,计算全部第二天比前一天价格高的值,加起来就是最后的最大收益。
class Solution: # @param prices, a list of integer # @return an integer def maxProfit(self, prices): profit = 0 length = len(prices) for i in range(0,length-1): if prices[i+1] > prices[i]: profit += prices[i+1] - prices[i] return profit
相关文章推荐
- Python语言下的机器学习库
- 以Python代码实例展示kNN算法的实际运用
- python装饰器
- 从Theano到Lasagne:基于Python的深度学习的框架和库
- tkinter Label标签相关
- Python WMI获取Windows系统信息 监控系统
- Python学习资源
- python 包管理
- python Synchronization between processes
- Python二维码生成库qrcode安装和使用示例
- Python点点滴滴积累---getopt使用(详解)
- python之报错的解决(持续总结)
- Python基础(十)正则表达式
- Python 深入理解yield
- tornado 学习笔记2 Python web主流框架
- tkinter 学习笔记
- python的一些日期处理方法(工具)
- python集合
- python培训Day1 随笔
- 快速入门:十分钟学会Python(转)