diff --git a/solution/0100-0199/0130.Surrounded Regions/README.md b/solution/0100-0199/0130.Surrounded Regions/README.md index 6cada1edbf4b0..2647639606ebe 100644 --- a/solution/0100-0199/0130.Surrounded Regions/README.md +++ b/solution/0100-0199/0130.Surrounded Regions/README.md @@ -24,7 +24,7 @@ tags: diff --git a/solution/0600-0699/0683.K Empty Slots/README.md b/solution/0600-0699/0683.K Empty Slots/README.md index 3e15824e340a5..7ebf13db1ba42 100644 --- a/solution/0600-0699/0683.K Empty Slots/README.md +++ b/solution/0600-0699/0683.K Empty Slots/README.md @@ -4,9 +4,13 @@ difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0683.K%20Empty%20Slots/README.md tags: - 树状数组 + - 线段树 + - 队列 - 数组 - 有序集合 - 滑动窗口 + - 单调队列 + - 堆(优先队列) --- diff --git a/solution/0600-0699/0683.K Empty Slots/README_EN.md b/solution/0600-0699/0683.K Empty Slots/README_EN.md index 5a47fcc2b298d..f510702a177ea 100644 --- a/solution/0600-0699/0683.K Empty Slots/README_EN.md +++ b/solution/0600-0699/0683.K Empty Slots/README_EN.md @@ -4,9 +4,13 @@ difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0683.K%20Empty%20Slots/README_EN.md tags: - Binary Indexed Tree + - Segment Tree + - Queue - Array - Ordered Set - Sliding Window + - Monotonic Queue + - Heap (Priority Queue) --- diff --git a/solution/1300-1399/1395.Count Number of Teams/README.md b/solution/1300-1399/1395.Count Number of Teams/README.md index bfc85de5e609a..12b866f755861 100644 --- a/solution/1300-1399/1395.Count Number of Teams/README.md +++ b/solution/1300-1399/1395.Count Number of Teams/README.md @@ -20,18 +20,18 @@ tags: -

 n 名士兵站成一排。每个士兵都有一个 独一无二 的评分 rating

+

 n 名士兵站成一排。每个士兵都有一个 独一无二 的评分 rating

-

3 个士兵可以组成一个作战单位,分组规则如下:

+

从中选出 3 个士兵组成一个作战单位,规则如下:

-

请你返回按上述条件可以组建的作战单位数量。每个士兵都可以是多个作战单位的一部分。

+

请你返回按上述条件组建的作战单位的方案数。

-

 

+

 

示例 1:

@@ -56,15 +56,15 @@ tags: 输出:4 -

 

+

 

提示:

diff --git a/solution/1500-1599/1515.Best Position for a Service Centre/README.md b/solution/1500-1599/1515.Best Position for a Service Centre/README.md index 7d82263a8f429..afe49d6976bed 100644 --- a/solution/1500-1599/1515.Best Position for a Service Centre/README.md +++ b/solution/1500-1599/1515.Best Position for a Service Centre/README.md @@ -6,6 +6,7 @@ rating: 2156 source: 第 197 场周赛 Q4 tags: - 几何 + - 数组 - 数学 - 随机化 --- diff --git a/solution/1500-1599/1515.Best Position for a Service Centre/README_EN.md b/solution/1500-1599/1515.Best Position for a Service Centre/README_EN.md index 48fa1754c83a5..2e61c76ee6c4a 100644 --- a/solution/1500-1599/1515.Best Position for a Service Centre/README_EN.md +++ b/solution/1500-1599/1515.Best Position for a Service Centre/README_EN.md @@ -6,6 +6,7 @@ rating: 2156 source: Weekly Contest 197 Q4 tags: - Geometry + - Array - Math - Randomized --- diff --git a/solution/3000-3099/3086.Minimum Moves to Pick K Ones/README.md b/solution/3000-3099/3086.Minimum Moves to Pick K Ones/README.md index e8f81d6682487..6d9c6b2a4207c 100644 --- a/solution/3000-3099/3086.Minimum Moves to Pick K Ones/README.md +++ b/solution/3000-3099/3086.Minimum Moves to Pick K Ones/README.md @@ -44,7 +44,7 @@ tags:

解释:如果游戏开始时 Alice 在 aliceIndex == 1 的位置上,按照以下步骤执行每个动作,他可以利用 3 次行动拾取 3 个 1 :