动态规划-122. 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).

题意解读：给定一个数组，数组的第i个元素就是第i天的股票价格。你可以进行任意次数的股票交易。但是有一个要求，你不可以同时进行多个股票交易。也就是说你必须在买进股票之前卖出股票

class Solution {
    public int maxProfit(int[] prices) {
        int res = 0;
        for(int i = 1; i < prices.length; i++)
            res += Math.max(0,prices[i]-prices[i-1]);
        return res;
    }
}