LeetCode-best-time-to-buy-and-sell-stock

原创于 2019-04-01 23:01:20 发布 · 157 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#best-time-to-buy-and-sell-stoc #LeetCode

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种用于计算给定股票价格数组中最大交易利润的算法。该算法通过一次遍历找到买入和卖出的最佳时机，实现高效计算最大收益。

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

Say you have an array for which the i th element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

import java.lang.Math;
public class Solution {
    public int maxProfit(int[] prices) {
        if(prices==null||prices.length==0)//这里必须考虑特殊情况
            return 0;
        int max_res=0;
        int min=prices[0];
        for(int i=1;i<prices.length;i++)
        {
            if(prices[i]<min)
                min = prices[i];
            else
                max_res = Math.max(prices[i]-min,max_res);
        }
        return max_res;
    }
}