Package g0301_0400.s0309_best_time_to_buy_and_sell_stock_with_cooldown

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    309 - Best Time to Buy and Sell Stock with Cooldown\.

    Medium

    You are given an array prices where prices[i] is the price of a given stock on the <code>i<sup>th</sup></code> day.

    Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:

    • After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).

    Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

    Example 1:

    Input: prices = 1,2,3,0,2

    Output: 3

    Explanation: transactions = buy, sell, cooldown, buy, sell

    Example 2:

    Input: prices = 1

    Output: 0

    Constraints:

    • 1 &lt;= prices.length &lt;= 5000

    • 0 &lt;= prices[i] &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxProfit(IntArray prices)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait