122. Best Time to Buy and Sell Stock II [LeetCode]
来源:互联网 发布:java监听器的作用 编辑:程序博客网 时间:2024/06/05 13:32
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).
题目要求:给定一份一段时间内的股价表。在此时间内,可以进行任意的买卖,求最大获利。其中,每一次卖都必须要在买之后。
分析一下,这是一个很简单的贪心算法。只要出现,某一日的股价比前一日高,即可以把该差价纳入最大收益中去。而不论在前面一日的股价是多少。
具体实现的java代码如下:
0 0
- 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
- 【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
- LeetCode #122. Best Time to Buy and Sell Stock II
- 122. Best Time to Buy and Sell Stock II LeetCode
- [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
- 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
- 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
- LeetCode - 122. Best Time to Buy and Sell Stock II
- LuceneInAction-explain()理解搜索结果评分
- mybatis反向工程生成插件使用
- PTC与Unity宣布战略合作-借助Vuforia加快增强现实开发
- 嵌套评论的数据库表设计(路径枚举)
- 超自然的箭头函数学习初步
- 122. Best Time to Buy and Sell Stock II [LeetCode]
- 深入研究Servlet线程安全性问题
- 2016年总结2017年计划
- 【原】ORACLE安装时,先决条件检查失败
- Deep Learning 开发工具Theano安装配置
- Oracle数据库 -- 触发器
- LeetCode --> Two Sum
- Eclipse快捷键 10个最有用的快捷键
- Codeforces Round #395 (Div. 2) D. Timofey and rectangles(思路)