You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
title: 121.The best time for buying and selling stocks
3
-
date: '2024.01.01 0:00'
3
+
date: "2024.01.01 0:00"
4
4
tags:
5
5
- Python
6
6
- answer
7
7
- Array
8
8
- Dynamic planning
9
9
abbrlink: 3a21fe32
10
+
docId: w9ffo1wycpbz50051cb7lyo5
10
11
---
12
+
11
13
# topic:
12
14
13
-
14
15
[2251.The number of flowers during the flowering period.md](https://leetcode-cn.com/problems/number-of-flowers-that-can-be-planted-in-garden/)
16
+
15
17
# Thought:
16
18
17
19
Dynamic planning,Find the least problem
18
20
Minority problem:FirstiThe maximum profit of heaven = max(Firsti-1The maximum profit of heaven, FirstiHeavenly price - forwardi-1The minimum price of heaven)
0 commit comments