Best Time to Buy and Sell Stock I, II

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

jialuyyy

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

阅读量285

点赞数

分类专栏： Dynamic Programming

本文链接：https://blog.csdn.net/jialuyyy/article/details/46556577

版权

Dynamic Programming 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Best Time to Buy and Sell Stock I

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.

Solution

dp[i] is the max profit of the interval [0,1,2,3......i],

so dp[i + 1] = max(dp[i], price[i + 1] - minPrice(0,1,2,3,4.....i));

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

Best Time to Buy and Sell Stock II

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

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

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