Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: add metadata info #2815

Merged
merged 1 commit into from
May 15, 2024
Merged

feat: add metadata info #2815

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions lcp/LCP 30. 魔塔游戏/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2030.%20%E9%AD%94%E5%A1%94%E6%B8%B8%E6%88%8F/README.md
tags:
- 贪心
- 数组
- 堆（优先队列）
---

# [LCP 30. 魔塔游戏](https://leetcode.cn/problems/p0NxJO)
Expand Down
9 changes: 8 additions & 1 deletion lcp/LCP 31. 变换的迷宫/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,13 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2031.%20%E5%8F%98%E6%8D%A2%E7%9A%84%E8%BF%B7%E5%AE%AB/README.md
tags:
- 深度优先搜索
- 广度优先搜索
- 数组
- 动态规划
- 矩阵
---

# [LCP 31. 变换的迷宫](https://leetcode.cn/problems/Db3wC1)
Expand Down Expand Up @@ -29,7 +36,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2031.%20%E5%8F%98%
> 输出：`true`
>
> 解释：
> ![maze.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2031.%20变换的迷宫/images/1615892239-SCIjyf-maze.gif)
> ![maze.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2031.%20%E5%8F%98%E6%8D%A2%E7%9A%84%E8%BF%B7%E5%AE%AB/images/1615892239-SCIjyf-maze.gif)

**示例 2：**

Expand Down
5 changes: 5 additions & 0 deletions lcp/LCP 32. 批量处理任务/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2032.%20%E6%89%B9%E9%87%8F%E5%A4%84%E7%90%86%E4%BB%BB%E5%8A%A1/README.md
tags:
- 贪心
- 数组
- 堆（优先队列）
---

# [LCP 32. 批量处理任务](https://leetcode.cn/problems/t3fKg1)
Expand Down
7 changes: 6 additions & 1 deletion lcp/LCP 33. 蓄水/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2033.%20%E8%93%84%E6%B0%B4/README.md
tags:
- 贪心
- 数组
- 堆（优先队列）
---

# [LCP 33. 蓄水](https://leetcode.cn/problems/o8SXZn)
Expand All @@ -27,7 +32,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2033.%20%E8%93%84%
> 解释：
> 第 1 次操作升级 bucket[0]；
> 第 2 ~ 4 次操作均选择蓄水，即可完成蓄水要求。
> ![vat1.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2033.%20蓄水/images/1616122992-RkDxoL-vat1.gif)
> ![vat1.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2033.%20%E8%93%84%E6%B0%B4/images/1616122992-RkDxoL-vat1.gif)

**示例 2：**

Expand Down
10 changes: 8 additions & 2 deletions lcp/LCP 34. 二叉树染色/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9F%93%E8%89%B2/README.md
tags:
- 树
- 动态规划
- 二叉树
---

# [LCP 34. 二叉树染色](https://leetcode.cn/problems/er-cha-shu-ran-se-UGC)
Expand All @@ -17,7 +22,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2034.%20%E4%BA%8C%
>
> 输出：`12`
>
> 解释：`结点 5、3、4 染成蓝色，获得最大的价值 5+3+4=12` > ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2034.%20二叉树染色/images/1616126267-BqaCRj-image.png)
> 解释：`结点 5、3、4 染成蓝色，获得最大的价值 5+3+4=12`
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9F%93%E8%89%B2/images/1616126267-BqaCRj-image.png)

**示例 2：**

Expand All @@ -26,7 +32,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2034.%20%E4%BA%8C%
> 输出：`16`
>
> 解释：结点 4、3、9 染成蓝色，获得最大的价值 4+3+9=16
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2034.%20二叉树染色/images/1616126301-gJbhba-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9F%93%E8%89%B2/images/1616126301-gJbhba-image.png)

**提示：**

Expand Down
7 changes: 6 additions & 1 deletion lcp/LCP 35. 电动车游城市/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2035.%20%E7%94%B5%E5%8A%A8%E8%BD%A6%E6%B8%B8%E5%9F%8E%E5%B8%82/README.md
tags:
- 图
- 最短路
- 堆（优先队列）
---

# [LCP 35. 电动车游城市](https://leetcode.cn/problems/DFPeFJ)
Expand All @@ -21,7 +26,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2035.%20%E7%94%B5%
> 在城市 1 仅充 3 单位电至城市 3，然后在城市 3 充 5 单位电，行驶至城市 5。
> 充电用时共 3\*10 + 5\*1= 35
> 行驶用时 3 + 5 = 8，此时总用时最短 43。
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2035.%20电动车游城市/images/1616125304-mzVxIV-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2035.%20%E7%94%B5%E5%8A%A8%E8%BD%A6%E6%B8%B8%E5%9F%8E%E5%B8%82/images/1616125304-mzVxIV-image.png)

**示例 2：**

Expand Down
5 changes: 5 additions & 0 deletions lcp/LCP 36. 最多牌组数/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2036.%20%E6%9C%80%E5%A4%9A%E7%89%8C%E7%BB%84%E6%95%B0/README.md
tags:
- 数组
- 动态规划
- 排序
---

# [LCP 36. 最多牌组数](https://leetcode.cn/problems/Up5XYM)
Expand Down
8 changes: 8 additions & 0 deletions lcp/LCP 37. 最小矩形面积/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,14 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2037.%20%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF/README.md
tags:
- 贪心
- 几何
- 数组
- 数学
- 组合数学
- 排序
---

# [LCP 37. 最小矩形面积](https://leetcode.cn/problems/zui-xiao-ju-xing-mian-ji)
Expand Down
13 changes: 9 additions & 4 deletions lcp/LCP 38. 守卫城堡/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/README.md
tags:
- 数组
- 动态规划
- 矩阵
---

# [LCP 38. 守卫城堡](https://leetcode.cn/problems/7rLGCR)
Expand Down Expand Up @@ -31,7 +36,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2038.%20%E5%AE%88%
> 输出：`3`
>
> 解释：至少需要放置三个障碍物
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20守卫城堡/images/1614828255-uuNdNJ-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/images/1614828255-uuNdNJ-image.png)

**示例 2：**

Expand All @@ -40,7 +45,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2038.%20%E5%AE%88%
> 输出：`-1`
>
> 解释：无论怎样修筑障碍物，均无法阻挡最左侧出生的恶魔到达城堡位置
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20守卫城堡/images/1614828208-oFlpVs-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/images/1614828208-oFlpVs-image.png)

**示例 3：**

Expand All @@ -49,7 +54,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2038.%20%E5%AE%88%
> 输出：`0`
>
> 解释：无需放置障碍物即可获得胜利
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20守卫城堡/images/1614828242-oveClu-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/images/1614828242-oveClu-image.png)

**示例 4：**

Expand All @@ -58,7 +63,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2038.%20%E5%AE%88%
> 输出：`4`
>
> 解释：至少需要放置 4 个障碍物，示意图为放置方法之一
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20守卫城堡/images/1614828218-sIAYkb-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/images/1614828218-sIAYkb-image.png)

**提示：**

Expand Down
8 changes: 7 additions & 1 deletion lcp/LCP 39. 无人机方阵/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,12 @@
---
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2039.%20%E6%97%A0%E4%BA%BA%E6%9C%BA%E6%96%B9%E9%98%B5/README.md
tags:
- 数组
- 哈希表
- 计数
- 矩阵
---

# [LCP 39. 无人机方阵](https://leetcode.cn/problems/0jQkd0)
Expand Down Expand Up @@ -31,7 +37,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2039.%20%E6%97%A0%
> 将 `[1,0]` 处的无人机移动至 `[1,1]` 处；
> 将 `[1,1]` 处的无人机移动至 `[1,0]` 处，其灯光颜色切换为颜色编号为 `6` 的灯光；
> 因此从`source` 到 `target` 所需要的最少灯光切换次数为 1。
> ![8819ccdd664e91c78cde3bba3c701986.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2039.%20无人机方阵/images/1628823765-uCDaux-8819ccdd664e91c78cde3bba3c701986.gif)
> ![8819ccdd664e91c78cde3bba3c701986.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2039.%20%E6%97%A0%E4%BA%BA%E6%9C%BA%E6%96%B9%E9%98%B5/images/1628823765-uCDaux-8819ccdd664e91c78cde3bba3c701986.gif){:height=300px}

**示例 2：**

Expand Down
5 changes: 5 additions & 0 deletions lcp/LCP 40. 心算挑战/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2040.%20%E5%BF%83%E7%AE%97%E6%8C%91%E6%88%98/README.md
tags:
- 贪心
- 数组
- 排序
---

# [LCP 40. 心算挑战](https://leetcode.cn/problems/uOAnQW)
Expand Down
11 changes: 8 additions & 3 deletions lcp/LCP 41. 黑白翻转棋/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/README.md
tags:
- 广度优先搜索
- 数组
- 矩阵
---

# [LCP 41. 黑白翻转棋](https://leetcode.cn/problems/fHi6rV)
Expand All @@ -11,7 +16,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2041.%20%E9%BB%91%

在 `n*m` 大小的棋盘中，有黑白两种棋子，黑棋记作字母 `"X"`, 白棋记作字母 `"O"`，空余位置记作 `"."`。当落下的棋子与其他相同颜色的棋子在行、列或对角线完全包围（中间不存在空白位置）另一种颜色的棋子，则可以翻转这些棋子的颜色。

![1.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20黑白翻转棋/images/1630396029-eTgzpN-6da662e67368466a96d203f67bb6e793.gif)![2.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20黑白翻转棋/images/1630396240-nMvdcc-8e4261afe9f60e05a4f740694b439b6b.gif)![3.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20黑白翻转棋/images/1630396291-kEtzLL-6fcb682daeecb5c3f56eb88b23c81d33.gif)
![1.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/images/1630396029-eTgzpN-6da662e67368466a96d203f67bb6e793.gif){:height=170px}![2.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/images/1630396240-nMvdcc-8e4261afe9f60e05a4f740694b439b6b.gif){:height=170px}![3.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/images/1630396291-kEtzLL-6fcb682daeecb5c3f56eb88b23c81d33.gif){:height=170px}

「力扣挑战赛」黑白翻转棋项目中，将提供给选手一个未形成可翻转棋子的棋盘残局，其状态记作 `chessboard`。若下一步可放置一枚黑棋，请问选手最多能翻转多少枚白棋。

Expand All @@ -37,7 +42,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2041.%20%E9%BB%91%
>
> 解释：
> 可以选择下在 `[2,2]` 处，能够翻转白方两枚棋子。
> ![2126c1d21b1b9a9924c639d449cc6e65.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20黑白翻转棋/images/1626683255-OBtBud-2126c1d21b1b9a9924c639d449cc6e65.gif)
> ![2126c1d21b1b9a9924c639d449cc6e65.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/images/1626683255-OBtBud-2126c1d21b1b9a9924c639d449cc6e65.gif)

**示例 3：**

Expand All @@ -47,7 +52,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2041.%20%E9%BB%91%
>
> 解释：
> 可以选择下在 `[6,3]` 处，能够翻转白方四枚棋子。
> ![803f2f04098b6174397d6c696f54d709.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20黑白翻转棋/images/1630393770-Puyked-803f2f04098b6174397d6c696f54d709.gif)
> ![803f2f04098b6174397d6c696f54d709.gif](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/images/1630393770-Puyked-803f2f04098b6174397d6c696f54d709.gif)

**提示：**

Expand Down
12 changes: 10 additions & 2 deletions lcp/LCP 42. 玩具套圈/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,14 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2042.%20%E7%8E%A9%E5%85%B7%E5%A5%97%E5%9C%88/README.md
tags:
- 几何
- 数组
- 哈希表
- 数学
- 二分查找
- 排序
---

# [LCP 42. 玩具套圈](https://leetcode.cn/problems/vFjcfV)
Expand All @@ -27,7 +35,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2042.%20%E7%8E%A9%
> 输出：`1`
>
> 解释： 如图所示，仅套中一个玩具
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2042.%20玩具套圈/images/1629194140-ydKiGF-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2042.%20%E7%8E%A9%E5%85%B7%E5%A5%97%E5%9C%88/images/1629194140-ydKiGF-image.png)

**示例 2：**

Expand All @@ -36,7 +44,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2042.%20%E7%8E%A9%
> 输出：`2`
>
> 解释： 如图所示，套中两个玩具
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2042.%20玩具套圈/images/1629194157-RiOAuy-image.png)
> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2042.%20%E7%8E%A9%E5%85%B7%E5%A5%97%E5%9C%88/images/1629194157-RiOAuy-image.png){:width="400px"}

**提示：**

Expand Down
7 changes: 6 additions & 1 deletion lcp/LCP 43. 十字路口的交通/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
---
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2043.%20%E5%8D%81%E5%AD%97%E8%B7%AF%E5%8F%A3%E7%9A%84%E4%BA%A4%E9%80%9A/README.md
tags:
- 数组
- 字符串
- 动态规划
---

# [LCP 43. 十字路口的交通](https://leetcode.cn/problems/Y1VbOX)
Expand All @@ -26,7 +31,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2043.%20%E5%8D%81%

各个车道驶出的车辆可能的行驶路线如图所示：

![图片.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2043.%20十字路口的交通/images/1630393755-gyPeMM-%E5%9B%BE%E7%89%87.png)
![图片.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2043.%20%E5%8D%81%E5%AD%97%E8%B7%AF%E5%8F%A3%E7%9A%84%E4%BA%A4%E9%80%9A/images/1630393755-gyPeMM-%E5%9B%BE%E7%89%87.png){:height="350px"}

**注意：**

Expand Down
17 changes: 7 additions & 10 deletions lcp/LCP 44. 开幕式焰火/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,13 @@
---
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2044.%20%E5%BC%80%E5%B9%95%E5%BC%8F%E7%84%B0%E7%81%AB/README.md
tags:
- 树
- 深度优先搜索
- 广度优先搜索
- 哈希表
- 二叉树
---

# [LCP 44. 开幕式焰火](https://leetcode.cn/problems/sZ59z6)
Expand All @@ -10,37 +17,27 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2044.%20%E5%BC%80%
<!-- 这里写题目描述 -->

「力扣挑战赛」开幕式开始了，空中绽放了一颗二叉树形的巨型焰火。

给定一棵二叉树 `root` 代表焰火，节点值表示巨型焰火这一位置的颜色种类。请帮小扣计算巨型焰火有多少种不同的颜色。

**示例 1：**

> 输入：`root = [1,3,2,1,null,2]`

>

> 输出：`3`

>

> 解释：焰火中有 3 个不同的颜色，值分别为 1、2、3

**示例 2：**

> 输入：`root = [3,3,3]`

>

> 输出：`1`

>

> 解释：焰火中仅出现 1 个颜色，值为 3

**提示：**

- `1 <= 节点个数 <= 1000`

- `1 <= Node.val <= 1000`

## 解法
Expand Down
8 changes: 8 additions & 0 deletions lcp/LCP 45. 自行车炫技赛场/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,14 @@
---
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/lcp/LCP%2045.%20%E8%87%AA%E8%A1%8C%E8%BD%A6%E7%82%AB%E6%8A%80%E8%B5%9B%E5%9C%BA/README.md
tags:
- 深度优先搜索
- 广度优先搜索
- 记忆化搜索
- 数组
- 动态规划
- 矩阵
---

# [LCP 45. 自行车炫技赛场](https://leetcode.cn/problems/kplEvH)
Expand Down
Loading
Loading