码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode]Best Time to Buy and Sell Stock II

时间:2014-08-07 00:20:17      阅读:257      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   http   color   os   io   for   

Best Time to Buy and Sell Stock II

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). 

算法思路:

计算出每个增区间的差值。求总和。

 1 public class Solution {
 2     public int maxProfit(int[] prices) {
 3         if(prices == null || prices.length < 2) return 0;
 4         int pre = 0,  post = 1,length = prices.length;
 5         int buy = 0,profit = 0;
 6         for(int i = 0; i < prices.length; i++,pre = i - 1, post = i + 1){
 7             if(post < length && prices[pre] >= prices[i] && prices[post] > prices[i]){
 8                 buy = prices[i];
 9             }
10             if( prices[i] > prices[pre] && (post != length ? prices[i] >= prices[post] : true) ){
11                 profit += prices[i] - buy;
12             }
13         }
14         return profit;
15     }
16 }

 

[leetcode]Best Time to Buy and Sell Stock II,布布扣,bubuko.com

[leetcode]Best Time to Buy and Sell Stock II

标签:des   style   blog   http   color   os   io   for   

原文地址:http://www.cnblogs.com/huntfor/p/3895969.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!