Best Time to Buy and Sell Stock

最新推荐文章于 2020-07-15 07:59:44 发布

原创最新推荐文章于 2020-07-15 07:59:44 发布 · 751 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一种寻找股票交易中最大利润的算法。该算法通过一次遍历输入的价格数组，跟踪记录最小购买价格和最大利润，最终返回最大可能利润。示例展示了如何使用此算法处理不同的价格序列。

Question:

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.

Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.

code:

public class Solution {
    public int maxProfit(int[] prices) {
        int minprice = Integer.MAX_VALUE;
        int maxprofit = 0;
        for(int i = 0;i<prices.length;i++){
            if(minprice > prices[i]){
                minprice = prices[i];
            }else if(prices[i]-minprice > maxprofit){
                maxprofit = prices[i]-minprice;
            }
        }
        return maxprofit;
    }
}