首页 > 其他 > 详细

Problem Best Time to Buy and Sell Stock 11

时间:2014-07-07 15:24:25      阅读:344      评论:0      收藏:0      [点我收藏+]

Problem Description:

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:
 1     public int maxProfit(int[] prices) {
 2         if  (prices.length <= 1) return  0;
 3         int sum = 0;
 4         for (int i = 0; i < prices.length - 1; i++) {
 5             int delta = prices[i+1] - prices[i];
 6             if  (delta > 0) {
 7                 sum += delta;
 8             }
 9         }
10         
11         return sum;
12     }

 

Problem Best Time to Buy and Sell Stock 11,布布扣,bubuko.com

Problem Best Time to Buy and Sell Stock 11

原文:http://www.cnblogs.com/liew/p/3815125.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!