Skip to content

Commit 414d666

Browse files
gazeldxgazeldx
committed
Renamed the images of examples by removing the leading 0s.
1 parent e741401 commit 414d666

14 files changed

Lines changed: 27 additions & 13 deletions

images/examples/0042_1.png renamed to images/examples/42_1.png

File renamed without changes.

images/examples/0695_1.jpg renamed to images/examples/695_1.jpg

File renamed without changes.

images/examples/0797_1.jpg renamed to images/examples/797_1.jpg

File renamed without changes.

images/examples/0797_2.jpg renamed to images/examples/797_2.jpg

File renamed without changes.

images/examples/0084_1.jpg renamed to images/examples/84_1.jpg

File renamed without changes.

images/examples/0084_2.jpg renamed to images/examples/84_2.jpg

File renamed without changes.

‎solutions/1-1000/200-number-of-islands.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ Output: 3
3434
- `1 <= m, n <= 300`
3535
- `grid[i][j]` is `'0'` or `'1'`.
3636

37-
# Thoughts
37+
# Intuition
3838
The island problem can be abstracted into a **graph theory** problem. This is an **undirected graph**:
3939

4040
![](../../images/graph_undirected_1.svg)
@@ -47,7 +47,7 @@ Finding the number of islands is to find the number of `connected components`.
4747

4848
Walk from one node to the adjacent node until all nodes on the island are visited.
4949

50-
## Steps
50+
## Approach
5151
1. Find the first land.
5252
1. Starting at the first land, find all the lands of the island.
5353
* There are two major ways to explore a `connected components` (island): **Breadth-First Search** and **Depth-First Search**.

‎solutions/1-1000/42-trapping-rain-water-2.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ LeetCode problem link: [42. Trapping Rain Water](https://leetcode.com/problems/t
55
Given `n` non-negative integers representing an elevation map where the width of each bar is `1`, compute how much water it can trap after raining.
66

77
### Example 1
8-
![](../../images/examples/0042_1.png)
8+
![](../../images/examples/42_1.png)
99
```
1010
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
1111
Output: 6

‎solutions/1-1000/42-trapping-rain-water.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ LeetCode problem link: [42. Trapping Rain Water](https://leetcode.com/problems/t
55
Given `n` non-negative integers representing an elevation map where the width of each bar is `1`, compute how much water it can trap after raining.
66

77
### Example 1
8-
![](../../images/examples/0042_1.png)
8+
![](../../images/examples/42_1.png)
99
```
1010
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
1111
Output: 6

‎solutions/1-1000/695-max-area-of-island.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ The `area` of an island is the number of cells with a value `1` in the island.
99
Return _the maximum area of an island_ in `grid`. If there is no island, return `0`.
1010

1111
## Example 1
12-
![](../../images/examples/0695_1.jpg)
12+
![](../../images/examples/695_1.jpg)
1313
```
1414
Input: grid = [
1515
[0,0,1,0,0,0,0,1,0,0,0,0,0],

0 commit comments

Comments
 (0)