Leetcode 刷题: Best Time to buy and sell stock

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

Richardliu2012

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

阅读量241

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Richardliu2012/article/details/51204760

本文介绍了一种算法，用于计算给定股票价格数组中能够获得的最大利润，假设只能进行一次买入和一次卖出操作。通过遍历价格数组并跟踪最低购买价格及最大可能利润来实现。

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

Say you have an array for which the ith 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.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

public class Solution {
public int maxProfit(int[] prices) {
//make decision for extreme conditions
if(prices.length==0 || prices == null)
return 0;

int profit=0, min=Integer.MAX_VALUE;
for(int i:prices){
min=(i < min)?i:min;
profit= (i-min)>profit ?(i-min):profit;

}
return profit;

}
}