LeetCode-121：Best Time to Buy and Sell Stock (一次股票交易最大利润)

最新推荐文章于 2023-04-23 17:24:18 发布

大树先生的博客

最新推荐文章于 2023-04-23 17:24:18 发布

阅读量1.2k

点赞数

分类专栏： LeetCode刷题 LeetCode 刷题文章标签： LeetCode 算法 Array 股票交易

本文链接：https://blog.csdn.net/koala_tree/article/details/78289313

版权

LeetCode刷题同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

LeetCode 刷题

71 篇文章 57 订阅

订阅专栏

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.

Idea

给定一个数组，其中的第i个元素为第i天给出的股票价格，求出一次交易利润。

对于这类问题，只需要对数组进行一次遍历，在遍历过程中记录利润，并在循环过程中保留最大利润即可。

Code

一次遍历—`Java`

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices == null || prices.length == 0){
            return 0;
        }
        int buy = prices[0];
        int max = 0;
        for (int i=0; i<prices.length; i++){
            if (prices[i] < buy){
                buy = prices[i];
            }else{
                int profit = prices[i]-buy;
                if (max < profit){
                    max = profit;
                }
            }
        }
        return max;
    }
}