Best Time to Buy and Sell Stock

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

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

0 ·

CC 4.0 BY-SA版权

leetCode 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一种寻找股票买卖最佳时机以实现最大利润的算法。该算法通过一次遍历股票价格数组来确定买入和卖出的最佳时刻，从而实现最大化收益。

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

class Solution {
public:
    int maxProfit(vector<int> &prices) {
		if(!prices.size())return 0;
		int rst = 0;
		int mini = prices[0];
		for(int i = 1; i < prices.size(); i++)
		{
			rst = max(rst, prices[i] - mini);
			mini = min(mini, prices[i]);
		}

		return rst;
    }
};