leetcode122. Best Time to Buy and Sell Stock II

题目链接:https://leetcode.com/problems/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).

Subscribe to see which companies asked this question.
题目意思:这个题没给输入输出，开始理解起来还是比较困难，后面看了我女神的博客http://blog.csdn.net/codetz/article/details/50636299总算搞清楚意思，大意:用一个数组表示股票每天的价格，数组的第i个数表示股票在第i天的价格。交易次数不限，但一次只能交易一支股票，也就是说手上最多只能持有一支股票，求最大收益。
思路:开始想的是动态规划，后面想了下是贪心，只要前一天的买小于后一天的卖就可以了，然后相减得到利润再把利润相加。
代码如下:

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