Best Time to Buy and Sell Stock II
来源:互联网 发布:幼儿园美工室活动计划 编辑:程序博客网 时间:2024/05/16 18:52
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).
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; }}
[3,2,4,10,11,6,4,7,8,3]
sum 会累加
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
- 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
- Best Time to Buy and Sell Stock II
- 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
- Best Time to Buy and Sell Stock II
- 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
- iOS 各种修饰符的区别汇总
- 利用 SysRq 键排除和诊断系统故障
- C/C++__字符串的结束符“\0”到底是什么
- hdoj1106排序(sort)
- return value of operator overloading in C++
- Best Time to Buy and Sell Stock II
- JNDI访问LDAP目录服务
- 标准Http协议支持六种请求方法
- iOS Notification 通知中心
- Maven核心概念之仓库,生命周期与插件
- python安装
- E - Easy Task --- (fisrt qualifying)
- 生成MyEclipse6.5&7.5&8.0注册码的java源码
- Android编程权威指南-第一章挑战练习二:添加后退按钮