LeetCode-121. Best Time to Buy and Sell Stock [C++][Java]

LeetCode-121. Best Time to Buy and Sell Stockhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/

题目描述

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:

Input: prices = [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.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.

Constraints:

• 1 <= prices.length <= 10^5
• 0 <= prices[i] <= 10^4

解题思路

【C++】

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() < 2) {return 0;}
        int minP = prices[0], maxDiff = 0;
        for (int i=1; i<prices.size(); ++i) {
            maxDiff = max(maxDiff, prices[i] - minP);
            minP = min(minP, prices[i]);       
        }
        return maxDiff;
    }
};

换种类似的思路

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() < 2) {return 0;}
        int sell = 0, buy = INT_MIN;
        for (int i = 0; i < prices.size(); ++i) {
            buy = max(buy, -prices[i]);
            sell = max(sell, buy + prices[i]);
        }
        return sell;
    }
};

【Java】

class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length < 2) {return 0;}
        int sell = 0, buy = Integer.MIN_VALUE;
        for (int i = 0; i < prices.length; ++i) {
            buy = Math.max(buy, -prices[i]);
            sell = Math.max(sell, buy + prices[i]);
        }
        return sell;
    }
}