leetcode-122

Best Time to Buy and Sell Stock II

题目

Say you have an array for which the i^th 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).

解题思路

所有收益，就是后一个减前一个的全部收益加一块

java代码：

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length ==0 ) return 0;   
        int income = 0;  
        for (int i = 1; i < prices.length; ++i) {  
            if(prices[i] > prices[i-1]) {  
                income += prices[i] - prices[i-1];  
            }  
        }  
        return income; 
    }
}

原题地址