Problem Best Time to Buy and Sell Stock 11

转载于 2014-06-29 15:00:00 发布 · 47 阅读

0 ·

CC 4.0 BY-SA版权

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

本文介绍了一种股票交易策略，允许投资者在不同时段内完成多次买卖操作，以最大化利润。通过计算相邻日期间的价格差，本文提供了一个简单的算法来实现这一目标。

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     }