lintcode-medium-Best Time to Buy and Sell Stock

最新推荐文章于 2025-09-06 22:33:46 发布

weixin_30449239

最新推荐文章于 2025-09-06 22:33:46 发布

阅读量61

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/goblinengineer/p/5276174.html

本文介绍了一种通过动态规划寻找给定股价数组中最大交易利润的算法。算法使用两个变量，一个记录遍历过程中的最低价格，另一个记录当前的最大利润。通过一次遍历即可得到最大利润。

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.

Given an example [3,2,3,1,2], return 1.

这道题也是动态规划，用一个变量min记录前i天最低的价格，用profit记录到第i天最大利润

public class Solution {
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    public int maxProfit(int[] prices) {
        // write your code here
        if(prices == null || prices.length == 0)
            return 0;
        
        int min = prices[0];
        int profit = 0;
        
        for(int i = 1; i < prices.length; i++){
            if(prices[i] < min)
                min = prices[i];
            
            profit = Math.max(profit, prices[i] - min);
        }
        
        return profit;
    }
}