【LeetCode】121.Best Time to Buy and Sell Stock(Easy)解题报告

最新推荐文章于 2022-07-29 20:36:59 发布

郝春雨

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量116

点赞数

分类专栏： LeetCode Array 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79207990

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【LeetCode】121.Best Time to Buy and Sell Stock(Easy)解题报告

题目地址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/
题目描述：

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.

Solution:

//time:O(n)
//space:O(1)
class Solution {
    public int maxProfit(int[] prices) {
        if(prices == null || prices.length < 2) return 0;
        int profit = 0;
        int min = prices[0];
        for(int price : prices){
            min = Math.min(min,price);
            profit = Math.max(profit,price - min);
        }
        return profit;
    }
}