Skip to content

Commit fe13c6d

Browse files
halfrosthalfrost
committed
Add solution 0374
1 parent b2a4f39 commit fe13c6d

22 files changed

+413
-139
lines changed

‎README.md

Lines changed: 108 additions & 108 deletions
Large diffs are not rendered by default.

‎leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower.go

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
package leetcode
2+
3+
import "sort"
4+
5+
/**
6+
* Forward declaration of guess API.
7+
* @param num your guess
8+
* @return -1 if num is lower than the guess number
9+
* 1 if num is higher than the guess number
10+
* otherwise return 0
11+
* func guess(num int) int;
12+
*/
13+
14+
func guessNumber(n int) int {
15+
return sort.Search(n, func(x int) bool { return guess(x) <= 0 })
16+
}
17+
18+
func guess(num int) int {
19+
return 0
20+
}

‎leetcode/0374.Guess-Number-Higher-or-Lower/374. Guess Number Higher or Lower_test.go

Lines changed: 58 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,58 @@
1+
package leetcode
2+
3+
import (
4+
"fmt"
5+
"testing"
6+
)
7+
8+
type question374 struct {
9+
para374
10+
ans374
11+
}
12+
13+
// para 是参数
14+
// one 代表第一个参数
15+
type para374 struct {
16+
n int
17+
}
18+
19+
// ans 是答案
20+
// one 代表第一个答案
21+
type ans374 struct {
22+
one int
23+
}
24+
25+
func Test_Problem374(t *testing.T) {
26+
27+
qs := []question374{
28+
29+
{
30+
para374{10},
31+
ans374{6},
32+
},
33+
34+
{
35+
para374{1},
36+
ans374{1},
37+
},
38+
39+
{
40+
para374{2},
41+
ans374{1},
42+
},
43+
44+
{
45+
para374{2},
46+
ans374{2},
47+
},
48+
// 如需多个测试，可以复制上方元素。
49+
}
50+
51+
fmt.Printf("------------------------Leetcode Problem 374------------------------\n")
52+
53+
for _, q := range qs {
54+
_, p := q.ans374, q.para374
55+
fmt.Printf("【input】:%v 【output】:%v\n", p, guessNumber(p.n))
56+
}
57+
fmt.Printf("\n\n\n")
58+
}

‎leetcode/0374.Guess-Number-Higher-or-Lower/README.md

Lines changed: 94 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,94 @@
1+
# [374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)
2+
3+
## 题目
4+
5+
We are playing the Guess Game. The game is as follows:
6+
7+
I pick a number from `1` to `n`. You have to guess which number I picked.
8+
9+
Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.
10+
11+
You call a pre-defined API `int guess(int num)`, which returns 3 possible results:
12+
13+
- `1`: The number I picked is lower than your guess (i.e. `pick < num`).
14+
- `1`: The number I picked is higher than your guess (i.e. `pick > num`).
15+
- `0`: The number I picked is equal to your guess (i.e. `pick == num`).
16+
17+
Return *the number that I picked*.
18+
19+
**Example 1:**
20+
21+
```
22+
Input: n = 10, pick = 6
23+
Output: 6
24+
```
25+
26+
**Example 2:**
27+
28+
```
29+
Input: n = 1, pick = 1
30+
Output: 1
31+
```
32+
33+
**Example 3:**
34+
35+
```
36+
Input: n = 2, pick = 1
37+
Output: 1
38+
```
39+
40+
**Example 4:**
41+
42+
```
43+
Input: n = 2, pick = 2
44+
Output: 2
45+
```
46+
47+
**Constraints:**
48+
49+
- `1 <= n <= 231 - 1`
50+
- `1 <= pick <= n`
51+
52+
## 题目大意
53+
54+
猜数字游戏的规则如下：
55+
56+
- 每轮游戏，我都会从 1 到 n 随机选择一个数字。 请你猜选出的是哪个数字。
57+
- 如果你猜错了，我会告诉你，你猜测的数字比我选出的数字是大了还是小了。
58+
59+
你可以通过调用一个预先定义好的接口 int guess(int num) 来获取猜测结果，返回值一共有 3 种可能的情况（-1，1 或 0）：
60+
61+
- 1：我选出的数字比你猜的数字小 pick < num
62+
- 1：我选出的数字比你猜的数字大 pick > num
63+
- 0：我选出的数字和你猜的数字一样。恭喜！你猜对了！pick == num
64+
65+
返回我选出的数字。
66+
67+
## 解题思路
68+
69+
- 这一题是简单题，和小时候玩的猜大猜小的游戏一样。思路很简单，二分查找即可。这一题和第 278 题类似。
70+
71+
## 代码
72+
73+
```go
74+
package leetcode
75+
76+
import "sort"
77+
78+
/**
79+
* Forward declaration of guess API.
80+
* @param num your guess
81+
* @return -1 if num is lower than the guess number
82+
* 1 if num is higher than the guess number
83+
* otherwise return 0
84+
* func guess(num int) int;
85+
*/
86+
87+
func guessNumber(n int) int {
88+
return sort.Search(n, func(x int) bool { return guess(x) <= 0 })
89+
}
90+
91+
func guess(num int) int {
92+
return 0
93+
}
94+
```

‎website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -129,5 +129,5 @@ func kSmallestPairs1(nums1 []int, nums2 []int, k int) [][]int {
129129
----------------------------------------------
130130
<div style="display: flex;justify-content: space-between;align-items: center;">
131131
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0372.Super-Pow/">⬅️上一页</a></p>
132-
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0376.Wiggle-Subsequence/">下一页➡️</a></p>
132+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower/">下一页➡️</a></p>
133133
</div>

‎website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md

Lines changed: 101 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,101 @@
1+
# [374. Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)
2+
3+
## 题目
4+
5+
We are playing the Guess Game. The game is as follows:
6+
7+
I pick a number from `1` to `n`. You have to guess which number I picked.
8+
9+
Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.
10+
11+
You call a pre-defined API `int guess(int num)`, which returns 3 possible results:
12+
13+
- `1`: The number I picked is lower than your guess (i.e. `pick < num`).
14+
- `1`: The number I picked is higher than your guess (i.e. `pick > num`).
15+
- `0`: The number I picked is equal to your guess (i.e. `pick == num`).
16+
17+
Return *the number that I picked*.
18+
19+
**Example 1:**
20+
21+
```
22+
Input: n = 10, pick = 6
23+
Output: 6
24+
```
25+
26+
**Example 2:**
27+
28+
```
29+
Input: n = 1, pick = 1
30+
Output: 1
31+
```
32+
33+
**Example 3:**
34+
35+
```
36+
Input: n = 2, pick = 1
37+
Output: 1
38+
```
39+
40+
**Example 4:**
41+
42+
```
43+
Input: n = 2, pick = 2
44+
Output: 2
45+
```
46+
47+
**Constraints:**
48+
49+
- `1 <= n <= 231 - 1`
50+
- `1 <= pick <= n`
51+
52+
## 题目大意
53+
54+
猜数字游戏的规则如下：
55+
56+
- 每轮游戏，我都会从 1 到 n 随机选择一个数字。 请你猜选出的是哪个数字。
57+
- 如果你猜错了，我会告诉你，你猜测的数字比我选出的数字是大了还是小了。
58+
59+
你可以通过调用一个预先定义好的接口 int guess(int num) 来获取猜测结果，返回值一共有 3 种可能的情况（-1，1 或 0）：
60+
61+
- 1：我选出的数字比你猜的数字小 pick < num
62+
- 1：我选出的数字比你猜的数字大 pick > num
63+
- 0：我选出的数字和你猜的数字一样。恭喜！你猜对了！pick == num
64+
65+
返回我选出的数字。
66+
67+
## 解题思路
68+
69+
- 这一题是简单题，和小时候玩的猜大猜小的游戏一样。思路很简单，二分查找即可。这一题和第 278 题类似。
70+
71+
## 代码
72+
73+
```go
74+
package leetcode
75+
76+
import "sort"
77+
78+
/**
79+
* Forward declaration of guess API.
80+
* @param num your guess
81+
* @return -1 if num is lower than the guess number
82+
* 1 if num is higher than the guess number
83+
* otherwise return 0
84+
* func guess(num int) int;
85+
*/
86+
87+
func guessNumber(n int) int {
88+
return sort.Search(n, func(x int) bool { return guess(x) <= 0 })
89+
}
90+
91+
func guess(num int) int {
92+
return 0
93+
}
94+
```
95+
96+
97+
----------------------------------------------
98+
<div style="display: flex;justify-content: space-between;align-items: center;">
99+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums/">⬅️上一页</a></p>
100+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0376.Wiggle-Subsequence/">下一页➡️</a></p>
101+
</div>

‎website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -78,6 +78,6 @@ func wiggleMaxLength(nums []int) int {
7878

7979
----------------------------------------------
8080
<div style="display: flex;justify-content: space-between;align-items: center;">
81-
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums/">⬅️上一页</a></p>
81+
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower/">⬅️上一页</a></p>
8282
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0300~0399/0377.Combination-Sum-IV/">下一页➡️</a></p>
8383
</div>

‎website/content/ChapterTwo/Array.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ weight: 1
2121
|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||38.1%|
2222
|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||42.9%|
2323
|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||60.5%|
24-
|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||50.8%|
24+
|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||50.9%|
2525
|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard| O(n)| O(n)||34.4%|
2626
|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|52.2%|
2727
|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||33.0%|
@@ -38,7 +38,7 @@ weight: 1
3838
|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||42.2%|
3939
|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||45.0%|
4040
|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||38.8%|
41-
|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|50.5%|
41+
|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|50.6%|
4242
|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|66.5%|
4343
|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|37.7%|
4444
|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||46.8%|
@@ -176,7 +176,7 @@ weight: 1
176176
|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||67.7%|
177177
|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||79.2%|
178178
|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||62.8%|
179-
|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.1%|
179+
|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.2%|
180180
|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||74.8%|
181181
|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||44.4%|
182182
|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.2%|

‎website/content/ChapterTwo/Backtracking.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -104,9 +104,9 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
104104
|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||66.4%|
105105
|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|48.1%|
106106
|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||60.5%|
107-
|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||50.8%|
107+
|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||50.9%|
108108
|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium| O(n)| O(n)|❤️|67.9%|
109-
|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium| O(n^2)| O(n)|❤️|50.4%|
109+
|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium| O(n^2)| O(n)|❤️|50.5%|
110110
|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard| O(n!)| O(n)|❤️|52.2%|
111111
|0052|N-Queens II|[Go]({{< relref "/ChapterFour/0001~0099/0052.N-Queens-II.md" >}})|Hard| O(n!)| O(n)|❤️|62.6%|
112112
|0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||40.0%|

‎website/content/ChapterTwo/Binary_Search.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -159,8 +159,9 @@ func peakIndexInMountainArray(A []int) int {
159159
|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||52.5%|
160160
|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.2%|
161161
|0367|Valid Perfect Square|[Go]({{< relref "/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md" >}})|Easy||||42.3%|
162+
|0374|Guess Number Higher or Lower|[Go]({{< relref "/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md" >}})|Easy||||45.5%|
162163
|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||57.0%|
163-
|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy| O(n)| O(1)||49.7%|
164+
|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy| O(n)| O(1)||49.8%|
164165
|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||47.2%|
165166
|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||48.7%|
166167
|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||42.8%|

‎website/content/ChapterTwo/Bit_Manipulation.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -69,7 +69,7 @@ X & ~X = 0
6969
|0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||65.2%|
7070
|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||50.9%|
7171
|0693|Binary Number with Alternating Bits|[Go]({{< relref "/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md" >}})|Easy| O(n)| O(1)|❤️|60.2%|
72-
|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium| O(n log n)| O(n)||55.9%|
72+
|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium| O(n log n)| O(n)||55.8%|
7373
|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy| O(n)| O(1)||64.9%|
7474
|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(1)||69.1%|
7575
|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium| O(n)| O(1)||35.0%|

‎website/content/ChapterTwo/Breadth_First_Search.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -15,18 +15,18 @@ weight: 10
1515
|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||56.0%|
1616
|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.3%|
1717
|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|24.2%|
18-
|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard| O(n)| O(n)||32.6%|
18+
|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard| O(n)| O(n)||32.7%|
1919
|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||30.3%|
2020
|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||57.0%|
2121
|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||50.3%|
22-
|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||44.4%|
22+
|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||44.5%|
2323
|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||43.6%|
2424
|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||44.8%|
2525
|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||63.2%|
2626
|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||62.8%|
2727
|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||62.1%|
2828
|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||41.5%|
29-
|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.6%|
29+
|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.7%|
3030
|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||49.0%|
3131
|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||43.8%|
3232
|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.6%|

0 commit comments

Comments
 (0)