Best Time to Buy and Sell Stock

最新推荐文章于 2025-04-18 22:24:21 发布

原创最新推荐文章于 2025-04-18 22:24:21 发布 · 745 阅读

0 ·

CC 4.0 BY-SA版权

Other Algorithms 同时被 2 个专栏收录

66 篇文章

订阅专栏

Easy

60 篇文章

订阅专栏

本文介绍了一种用于计算给定股票价格数组中最大可能利润的算法。该算法假设只能进行一次买卖操作，并通过迭代找到最低买入价格和最高卖出价格之间的最大差额。

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.

public class Solution {
    public int maxProfit(int[] prices) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if(prices.length == 0)
			return 0;
		int profit = 0;
		int minValue = prices[0];
		for(int i = 0; i < prices.length; i++){
			if(prices[i] - minValue > profit)
				profit = prices[i] - minValue;
			if(prices[i] < minValue)
				minValue = prices[i];
		}
		return profit;
	}
}