121 - Best Time to Buy and Sell Stock

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

绿水兰田

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

阅读量147

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/95478232

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

Problem

Say you have an array for which the i^th element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.

Code

public class Solution {
    public int maxProfit(int[] prices) {
        int ret = 0;
        int minx = Integer.MAX_VALUE;
        for (int price : prices) {
            if (price - minx > ret) {
                ret = price - minx;
            }
            if (price < minx) {
                minx = price;
            }
        }
        return ret;
    }
}