【Best Time to Buy and Sell Stock II】

正在沿着IT树往上爬

已于 2022-04-24 15:46:14 修改

阅读量625

点赞数

分类专栏： LeetCode 文章标签： java leetcode

于 2022-04-24 15:45:26 首次发布

本文链接：https://blog.csdn.net/weixin_39400958/article/details/124382447

版权

LeetCode 专栏收录该内容

51 篇文章

订阅专栏

该博客讨论了一个关于计算股票交易中最大可能利润的问题。给定一个整数数组，代表每天的股票价格，你可以进行买入和卖出操作，但最多只能持有一股。算法的目标是在所有可能的操作中找到最大的总利润。示例展示了如何通过比较最低价格和当前价格来实现这个目标，并给出了不同价格情况下的最佳交易策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given an integer array prices where prices[i] is the price of a given stock on the i^th day.

On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.

Find and return the maximum profit you can achieve.

Example 1:

Input: prices = [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.
Total profit is 4 + 3 = 7.

Example 2:

Input: prices = [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.
Total profit is 4.

Example 3:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.

Constraints:

1 <= prices.length <= 3 * 10⁴
0 <= prices[i] <= 10⁴

Java Completion:

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