Skip to content

Commit bc66872

Browse files
committed
[Add] docs for week6 and week7
1 parent 62dd0cf commit bc66872

File tree

12 files changed

+182
-0
lines changed

12 files changed

+182
-0
lines changed

Diff for: docs/leet-code/week-6/1.md

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
---
2+
sidebar_position: 1
3+
---
4+
5+
# 0743-network-delay-time
6+
#
7+
[**View Problem**](https://leetcode.com/problems/network-delay-time)
8+
9+
```python 0743-network-delay-time
10+
import random
11+
12+
sizes = [100, 1000, 10000, 100000]
13+
datas = [
14+
[random.randint(30, 100) for i in range(size)]
15+
for size in sizes
16+
]
17+
func_name = "networkDelayTime"
18+
```

Diff for: docs/leet-code/week-6/2.md

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
---
2+
sidebar_position: 2
3+
---
4+
5+
# 1584-min-cost-to-connect-all-points
6+
#
7+
[**View Problem**](https://leetcode.com/problems/min-cost-to-connect-all-points)
8+
9+
```python 1584-min-cost-to-connect-all-points
10+
import random
11+
12+
sizes = [100, 1000, 10000, 100000]
13+
datas = [
14+
[random.randint(30, 100) for i in range(size)]
15+
for size in sizes
16+
]
17+
func_name = "minCostConnectPoints"
18+
```

Diff for: docs/leet-code/week-6/3.md

+22
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
---
2+
sidebar_position: 3
3+
---
4+
5+
# 0198-house-robber
6+
#
7+
[**View Problem**](https://leetcode.com/problems/house-robber)
8+
9+
```python 0198-house-robber
10+
import random
11+
12+
elem = ["."] + [str(i) for i in range(1, 10)]
13+
sizes = [1]
14+
datas = [
15+
[
16+
[elem[random.randint(0, 9)] for _ in range(9)]
17+
for _ in range(9)
18+
]
19+
]
20+
21+
func_name = "rob"
22+
```

Diff for: docs/leet-code/week-6/4.md

+22
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
---
2+
sidebar_position: 4
3+
---
4+
5+
# 0213-house-robber-ii
6+
#
7+
[**View Problem**](https://leetcode.com/problems/house-robber-ii)
8+
9+
```python 0213-house-robber-ii
10+
import random
11+
12+
elem = ["."] + [str(i) for i in range(1, 10)]
13+
sizes = [1]
14+
datas = [
15+
[
16+
[elem[random.randint(0, 9)] for _ in range(9)]
17+
for _ in range(9)
18+
]
19+
]
20+
21+
func_name = "rob"
22+
```

Diff for: docs/leet-code/week-6/5.md

+22
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
---
2+
sidebar_position: 5
3+
---
4+
5+
# 0300-longest-increasing-subsequence
6+
#
7+
[**View Problem**](https://leetcode.com/problems/longest-increasing-subsequence)
8+
9+
```python 0300-longest-increasing-subsequence
10+
import random
11+
12+
elem = ["."] + [str(i) for i in range(1, 10)]
13+
sizes = [1]
14+
datas = [
15+
[
16+
[elem[random.randint(0, 9)] for _ in range(9)]
17+
for _ in range(9)
18+
]
19+
]
20+
21+
func_name = "lengthOfLIS"
22+
```

Diff for: docs/leet-code/week-6/_category_.json

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
{
2+
"position": 6,
3+
"label": "Week 6",
4+
"collapsible": true,
5+
"collapsed": true
6+
}

Diff for: docs/leet-code/week-6/index.md

+7
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
sidebar_position: 600
3+
---
4+
5+
# Week 6
6+
7+
Week 6. Advanced Graphs / 1-D DP

Diff for: docs/leet-code/week-7/1.md

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
---
2+
sidebar_position: 1
3+
---
4+
5+
# 1143-longest-common-subsequence
6+
#
7+
[**View Problem**](https://leetcode.com/problems/longest-common-subsequence)
8+
9+
```python 1143-longest-common-subsequence
10+
import random
11+
12+
sizes = [100, 1000, 10000, 100000]
13+
datas = [
14+
[random.randint(30, 100) for i in range(size)]
15+
for size in sizes
16+
]
17+
func_name = "longestCommonSubsequence"
18+
```

Diff for: docs/leet-code/week-7/2.md

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
---
2+
sidebar_position: 2
3+
---
4+
5+
# 0329-longest-increasing-path-in-a-matrix
6+
#
7+
[**View Problem**](https://leetcode.com/problems/longest-increasing-path-in-a-matrix)
8+
9+
```python 0329-longest-increasing-path-in-a-matrix
10+
import random
11+
12+
sizes = [100, 1000, 10000, 100000]
13+
datas = [
14+
[random.randint(30, 100) for i in range(size)]
15+
for size in sizes
16+
]
17+
func_name = "longestIncreasingPath"
18+
```

Diff for: docs/leet-code/week-7/3.md

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
---
2+
sidebar_position: 3
3+
---
4+
5+
# 0072-edit-distance
6+
#
7+
[**View Problem**](https://leetcode.com/problems/edit-distance)
8+
9+
```python 0072-edit-distance
10+
import random
11+
12+
sizes = [100, 1000, 10000, 100000]
13+
datas = [
14+
[random.randint(30, 100) for i in range(size)]
15+
for size in sizes
16+
]
17+
func_name = "minDistance"
18+
```

Diff for: docs/leet-code/week-7/_category_.json

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
{
2+
"position": 7,
3+
"label": "Week 7",
4+
"collapsible": true,
5+
"collapsed": true
6+
}

Diff for: docs/leet-code/week-7/index.md

+7
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
---
2+
sidebar_position: 700
3+
---
4+
5+
# Week 7
6+
7+
Week 7. 2-D DP / Bit Manipulation

0 commit comments

Comments
 (0)