122. Best Time to Buy and Sell Stock II
2016-03-01 12:37
267 查看
题目
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).
Subscribe to see which companies asked this question
翻译
对于每一笔交易 假设是从i天买入 j天卖出 ,如果有j+1天的价格高于j天,所以肯定是从i到j+1利润更高,同样的如果有第i-1天价格比第i天更低,肯定是从i-1天到j天利润更高。源码
JavaScript/** * @param {number[]} prices * @return {number} */ var maxProfit = function(prices) { if(prices.length<2) return 0; var sum=0; for(var i=0;i<prices.length;i++) { if(prices[i]>prices[i-1]){ sum=sum+(prices[i]-prices[i-1]); } } return sum; };
相关文章推荐
- c++ 获取外网ip地址
- Java中的同步与死锁
- 引用的本质是什么?
- android studio JNI(NDK)超详细图文步骤,适合新手
- JVM中的垃圾收集算法和Heap分区简记
- HDUJ 1754 I Hate It
- SPRING IN ACTION 第4版笔记-第一章-004-用类来管理DI
- 第 23 章 尝试互联网
- myeclipse导入tomcat源码
- sql查询语句的优化,exists与in的更换
- poj-1584 判断凸包算法+极角排序+判断点在几何内外 模板
- tachyon
- 4.5.3 ULtra Pull To Refresh
- 极大似然法估计与极大验后法估计
- hdu 1541 Stars【思维】
- Spring实现动态数据源,支持动态添加、删除和设置权重及读写分离
- 【设计模式:单例模式】使用单例模式载入properties文件
- 【解压缩命令】 -费元星
- JQuery判断数组中是否包含某个元素$.inArray("元素字符串", 数组名称);
- 24点算法