【LeetCode】 122. Best Time to Buy and Sell Stock II 买卖股票的最佳时机 II（Easy）（JAVA）每日一题

【LeetCode】 122. Best Time to Buy and Sell Stock II 买卖股票的最佳时机 II（Easy）（JAVA）

题目地址: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

题目描述：

Say you have an array prices 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

Constraints:

• 1 <= prices.length <= 3 * 10 ^ 4
• 0 <= prices[i] <= 10 ^ 4

题目大意

给定一个数组，它的第 i 个元素是一支给定股票第 i 天的价格。

设计一个算法来计算你所能获取的最大利润。你可以尽可能地完成更多的交易（多次买卖一支股票）。

注意：你不能同时参与多笔交易（你必须在再次购买前出售掉之前的股票）。

解题方法

1. 这道题因为交易的次数是无限的
2. 所以，只要后一天比前一天的价格更高，就可以交易一次
3. 遍历数组 prices 的所有元素即可

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

执行用时：1 ms, 在所有 Java 提交中击败了 99.54% 的用户
内存消耗：38.4 MB, 在所有 Java 提交中击败了 84.27% 的用户

欢迎关注我的公众号，LeetCode 每日一题更新