tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.3 KiB
1.3 KiB
TODO 0309. 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 i^{th} 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: 0Constraints:
1 <= prices.length <= 50000 <= prices[i] <= 1000
TODO Approach
Write your approach here.
TODO Python
class Solution:
def maxProfit(self, prices: List[int]) -> int:TODO C++
class Solution {
public:
int maxProfit(vector<int>& prices) {
}
};