LeetCode 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天的股价，可以交易任意次，求最大收益

思路：贪心算法。只要满足递增关系，就将相应的数相加即可

代码如下：

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