LeetCode Best Time to Buy and Sell Stock II

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:

这道题目和上一道的不同之处在于可以买入卖出多次。

这个时候可以进行这样的题目转换：就是找所有递增的子序列的递增之和。

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