Leetcode: Best Time to Buy and Sell Stock II
来源:互联网 发布:正规网络彩票销售平台 编辑:程序博客网 时间:2024/06/06 03:13
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).
思路:在每个低谷买入,高峰卖出,差值相加。
Solution:
public class Solution { public int maxProfit(int[] prices) { if (prices == null || prices.length == 0 || prices.length == 1) { return 0; } int result = 0; for (int i = 1; i < prices.length; i++) { if (prices[i] > prices[i - 1]) { result += prices[i] - prices[i - 1]; } } return result; }}
0 0
- [LeetCode]Best Time to Buy and Sell Stock II
- LeetCode Best Time to Buy and Sell Stock II
- Leetcode: Best Time to Buy and Sell Stock II
- [Leetcode] Best Time to Buy and Sell Stock II
- LeetCode : Best Time to Buy and Sell Stock II
- LeetCode Best Time to Buy and Sell Stock II
- [LeetCode] Best Time to Buy and Sell Stock II
- leetcode 61: Best Time to Buy and Sell Stock II
- [LeetCode] Best time to buy and sell a stock II
- 【leetcode】Best Time to Buy and Sell Stock II
- LeetCode - Best Time to Buy and Sell Stock II
- LeetCode之Best Time to Buy and Sell Stock II
- [LeetCode]Best Time to Buy and Sell Stock II
- [Leetcode]Best Time to Buy and Sell Stock II
- [leetcode]Best Time to Buy and Sell Stock II
- [LeetCode] Best Time to Buy and Sell Stock II
- LeetCode-Best Time to Buy and Sell Stock II
- [leetcode] Best Time to Buy and Sell Stock II
- 大冬天的,很多人都睡了
- 考研日记--9.01--一层秋雨一层凉
- 考研日记--9.02
- 考研日记---9.04---TT小受受莫走
- 解决ubuntu 14.04下显示线缆被拔出的问题
- Leetcode: Best Time to Buy and Sell Stock II
- 呵呵
- 我是什么
- 常用JS验证整理
- DLL和DLL导出类(ZZ)
- DLL导出类的问题(DLL地狱问题)
- 深入理解ANGULARUI路由_UI-ROUTER
- 是方法是否
- 编写DLL所学所思