Add solution 0028、2021

leetcode/0028.Implement-strStr/README.md → leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/README.md

@@ -1,4 +1,4 @@
-# [28. Implement strStr()](https://leetcode.com/problems/implement-strstr/)
+# [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)
 
 ## 题目
 

leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street.go

@@ -0,0 +1,33 @@
+package leetcode
+
+import (
+	"sort"
+)
+
+type lightItem struct {
+	index int
+	sign  int
+}
+
+func brightestPosition(lights [][]int) int {
+	lightMap, lightItems := map[int]int{}, []lightItem{}
+	for _, light := range lights {
+		lightMap[light[0]-light[1]] += 1
+		lightMap[light[0]+light[1]+1] -= 1
+	}
+	for k, v := range lightMap {
+		lightItems = append(lightItems, lightItem{index: k, sign: v})
+	}
+	sort.SliceStable(lightItems, func(i, j int) bool {
+		return lightItems[i].index < lightItems[j].index
+	})
+	res, border, tmp := 0, 0, 0
+	for _, v := range lightItems {
+		tmp += v.sign
+		if border < tmp {
+			res = v.index
+			border = tmp
+		}
+	}
+	return res
+}

leetcode/2021.Brightest-Position-on-Street/2021. Brightest Position on Street_test.go

@@ -0,0 +1,56 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question2021 struct {
+	para2021
+	ans2021
+}
+
+// para 是参数
+type para2021 struct {
+	lights [][]int
+}
+
+// ans 是答案
+type ans2021 struct {
+	ans int
+}
+
+func Test_Problem2021(t *testing.T) {
+
+	qs := []question2021{
+
+		{
+			para2021{[][]int{{-3, 2}, {1, 2}, {3, 3}}},
+			ans2021{-1},
+		},
+
+		{
+			para2021{[][]int{{1, 0}, {0, 1}}},
+			ans2021{1},
+		},
+
+		{
+			para2021{[][]int{{1, 2}}},
+			ans2021{-1},
+		},
+
+		{
+			para2021{[][]int{{1, 1}, {2, 4}, {-1, 0}, {-3, 5}, {1, 2}}},
+			ans2021{-1},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 2021------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans2021, q.para2021
+		fmt.Printf("【input】:%v      ", p)
+		fmt.Printf("【output】:%v      \n", brightestPosition(p.lights))
+	}
+	fmt.Printf("\n\n\n")
+}

leetcode/2021.Brightest-Position-on-Street/README.md

@@ -0,0 +1,109 @@
+# [2021. Brightest Position on Street](https://leetcode.com/problems/brightest-position-on-street/)
+
+
+## 题目
+
+A perfectly straight street is represented by a number line. The street has street lamp(s) on it and is represented by a 2D integer array `lights`. Each `lights[i] = [positioni, rangei]` indicates that there is a street lamp at position `positioni` that lights up the area from `[positioni - rangei, positioni + rangei]` (**inclusive**).
+
+The **brightness** of a position `p` is defined as the number of street lamp that light up the position `p`.
+
+Given `lights`, return *the **brightest** position on the street. If there are multiple brightest positions, return the **smallest** one.*
+
+**Example 1:**
+
+![https://assets.leetcode.com/uploads/2021/09/28/image-20210928155140-1.png](https://assets.leetcode.com/uploads/2021/09/28/image-20210928155140-1.png)
+
+```
+Input: lights = [[-3,2],[1,2],[3,3]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [(-3) - 2, (-3) + 2] = [-5, -1].
+The second street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+The third street lamp lights up the area from [3 - 3, 3 + 3] = [0, 6].
+
+Position -1 has a brightness of 2, illuminated by the first and second street light.
+Positions 0, 1, 2, and 3 have a brightness of 2, illuminated by the second and third street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Example 2:**
+
+```
+Input: lights = [[1,0],[0,1]]
+Output: 1
+Explanation:
+The first street lamp lights up the area from [1 - 0, 1 + 0] = [1, 1].
+The second street lamp lights up the area from [0 - 1, 0 + 1] = [-1, 1].
+
+Position 1 has a brightness of 2, illuminated by the first and second street light.
+Return 1 because it is the brightest position on the street.
+
+```
+
+**Example 3:**
+
+```
+Input: lights = [[1,2]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+
+Positions -1, 0, 1, 2, and 3 have a brightness of 1, illuminated by the first street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Constraints:**
+
+- `1 <= lights.length <= 105`
+- `lights[i].length == 2`
+- `108 <= positioni <= 108`
+- `0 <= rangei <= 108`
+
+## 题目大意
+
+一条完全笔直的街道由一条数字线表示。街道上有路灯，由二维数据表示。每个 `lights[i] = [positioni, rangei]` 表示位置 `i` 处有一盏路灯，灯可以照亮从 `[positioni - rangei, positioni + rangei]` （含）的区域。 位置 `p` 的亮度定义为点亮位置 `p` 的路灯数量。 给定路灯，返回街道上最亮的位置。如果有多个最亮的位置，则返回最小的一个。
+
+## 解题思路
+
+- 先将每个路灯的起始和终点位置计算出来。这样我们得到了一堆坐标点。假设灯照亮的范围是 [A, B]，那么在坐标轴上 A 坐标点处 + 1， B + 1 坐标点处 -1 。这样处理的含义是：坐标点 A 可以被一盏灯照亮，所以它照亮次数加一，坐标点 B + 1 出了灯照亮的范围了，所以照亮次数减一。那么从坐标轴坐标开始扫一遍，每次遇到 + 1 的时候就 + 1，遇到 - 1 的地方就 - 1。如此可以算出某个坐标点处，可以被灯照亮的总次数。
+- 需要注意的点是，题目给的测试数据可能会有单点照亮的情况，即某一盏灯只照亮一个坐标点，灯照范围为 0。同一个坐标点也可能是多个灯的起点。用一个 map 去重坐标点即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+	"sort"
+)
+
+type lightItem struct {
+	index int
+	sign  int
+}
+
+func brightestPosition(lights [][]int) int {
+	lightMap, lightItems := map[int]int{}, []lightItem{}
+	for _, light := range lights {
+		lightMap[light[0]-light[1]] += 1
+		lightMap[light[0]+light[1]+1] -= 1
+	}
+	for k, v := range lightMap {
+		lightItems = append(lightItems, lightItem{index: k, sign: v})
+	}
+	sort.SliceStable(lightItems, func(i, j int) bool {
+		return lightItems[i].index < lightItems[j].index
+	})
+	res, border, tmp := 0, 0, 0
+	for _, v := range lightItems {
+		tmp += v.sign
+		if border < tmp {
+			res = v.index
+			border = tmp
+		}
+	}
+	return res
+}
+```

website/content/ChapterFour/0001~0099/0027.Remove-Element.md

@@ -94,5 +94,5 @@ func removeElement(nums []int, val int) int {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Implement-strStr/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/">下一页➡️</a></p>
 </div>

website/content/ChapterFour/0001~0099/0028.Implement-strStr.md → website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md

@@ -1,4 +1,4 @@
-# [28. Implement strStr()](https://leetcode.com/problems/implement-strstr/)
+# [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)
 
 ## 题目
 

website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md

@@ -150,6 +150,6 @@ func divide1(divided int, divisor int) int {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Implement-strStr/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words/">下一页➡️</a></p>
 </div>

website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md

@@ -74,5 +74,5 @@ func minimumDifference(nums []int, k int) int {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2021.Brightest-Position-on-Street/">下一页➡️</a></p>
 </div>

website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md

@@ -0,0 +1,116 @@
+# [2021. Brightest Position on Street](https://leetcode.com/problems/brightest-position-on-street/)
+
+
+## 题目
+
+A perfectly straight street is represented by a number line. The street has street lamp(s) on it and is represented by a 2D integer array `lights`. Each `lights[i] = [positioni, rangei]` indicates that there is a street lamp at position `positioni` that lights up the area from `[positioni - rangei, positioni + rangei]` (**inclusive**).
+
+The **brightness** of a position `p` is defined as the number of street lamp that light up the position `p`.
+
+Given `lights`, return *the **brightest** position on the street. If there are multiple brightest positions, return the **smallest** one.*
+
+**Example 1:**
+
+![https://assets.leetcode.com/uploads/2021/09/28/image-20210928155140-1.png](https://assets.leetcode.com/uploads/2021/09/28/image-20210928155140-1.png)
+
+```
+Input: lights = [[-3,2],[1,2],[3,3]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [(-3) - 2, (-3) + 2] = [-5, -1].
+The second street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+The third street lamp lights up the area from [3 - 3, 3 + 3] = [0, 6].
+
+Position -1 has a brightness of 2, illuminated by the first and second street light.
+Positions 0, 1, 2, and 3 have a brightness of 2, illuminated by the second and third street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Example 2:**
+
+```
+Input: lights = [[1,0],[0,1]]
+Output: 1
+Explanation:
+The first street lamp lights up the area from [1 - 0, 1 + 0] = [1, 1].
+The second street lamp lights up the area from [0 - 1, 0 + 1] = [-1, 1].
+
+Position 1 has a brightness of 2, illuminated by the first and second street light.
+Return 1 because it is the brightest position on the street.
+
+```
+
+**Example 3:**
+
+```
+Input: lights = [[1,2]]
+Output: -1
+Explanation:
+The first street lamp lights up the area from [1 - 2, 1 + 2] = [-1, 3].
+
+Positions -1, 0, 1, 2, and 3 have a brightness of 1, illuminated by the first street light.
+Out of all these positions, -1 is the smallest, so return it.
+
+```
+
+**Constraints:**
+
+- `1 <= lights.length <= 105`
+- `lights[i].length == 2`
+- `108 <= positioni <= 108`
+- `0 <= rangei <= 108`
+
+## 题目大意
+
+一条完全笔直的街道由一条数字线表示。街道上有路灯，由二维数据表示。每个 `lights[i] = [positioni, rangei]` 表示位置 `i` 处有一盏路灯，灯可以照亮从 `[positioni - rangei, positioni + rangei]` （含）的区域。 位置 `p` 的亮度定义为点亮位置 `p` 的路灯数量。 给定路灯，返回街道上最亮的位置。如果有多个最亮的位置，则返回最小的一个。
+
+## 解题思路
+
+- 先将每个路灯的起始和终点位置计算出来。这样我们得到了一堆坐标点。假设灯照亮的范围是 [A, B]，那么在坐标轴上 A 坐标点处 + 1， B + 1 坐标点处 -1 。这样处理的含义是：坐标点 A 可以被一盏灯照亮，所以它照亮次数加一，坐标点 B + 1 出了灯照亮的范围了，所以照亮次数减一。那么从坐标轴坐标开始扫一遍，每次遇到 + 1 的时候就 + 1，遇到 - 1 的地方就 - 1。如此可以算出某个坐标点处，可以被灯照亮的总次数。
+- 需要注意的点是，题目给的测试数据可能会有单点照亮的情况，即某一盏灯只照亮一个坐标点，灯照范围为 0。同一个坐标点也可能是多个灯的起点。用一个 map 去重坐标点即可。
+
+## 代码
+
+```go
+package leetcode
+
+import (
+	"sort"
+)
+
+type lightItem struct {
+	index int
+	sign  int
+}
+
+func brightestPosition(lights [][]int) int {
+	lightMap, lightItems := map[int]int{}, []lightItem{}
+	for _, light := range lights {
+		lightMap[light[0]-light[1]] += 1
+		lightMap[light[0]+light[1]+1] -= 1
+	}
+	for k, v := range lightMap {
+		lightItems = append(lightItems, lightItem{index: k, sign: v})
+	}
+	sort.SliceStable(lightItems, func(i, j int) bool {
+		return lightItems[i].index < lightItems[j].index
+	})
+	res, border, tmp := 0, 0, 0
+	for _, v := range lightItems {
+		tmp += v.sign
+		if border < tmp {
+			res = v.index
+			border = tmp
+		}
+	}
+	return res
+}
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array/">下一页➡️</a></p>
+</div>

website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md

@@ -79,6 +79,6 @@ func construct2DArray(original []int, m int, n int) [][]int {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2021.Brightest-Position-on-Street/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone/">下一页➡️</a></p>
 </div>

website/content/ChapterFour/2200~2299/_index.md

@@ -0,0 +1,4 @@
+---
+bookCollapseSection: true
+weight: 20
+---

website/content/ChapterTwo/Breadth_First_Search.md

@@ -72,7 +72,7 @@ weight: 10
 |0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
 |0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.6%|
 |0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||53.8%|
-|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.0%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.1%|
 |0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||44.6%|
 |0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.1%|
 |1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||64.8%|

website/content/ChapterTwo/Depth_First_Search.md

@@ -91,7 +91,7 @@ weight: 9
 |0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.6%|
 |0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.3%|
 |0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium||||57.0%|
-|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.0%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.1%|
 |0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.8%|
 |0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||49.9%|
 |0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.0%|

website/content/ChapterTwo/Hash_Table.md

@@ -152,7 +152,7 @@ weight: 13
 |1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
 |1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
 |1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.0%|
-|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||68.5%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||68.6%|
 |1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.1%|
 |1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.3%|
 |1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||54.2%|