Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit4c943ca

Browse files
committed
Reworded.
1 parenta10d65b commit4c943ca

File tree

3 files changed

+10
-7
lines changed

3 files changed

+10
-7
lines changed

‎README.md‎

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -106,8 +106,8 @@ You can skip the more difficult problems and do them later.
106106
-[797. All Paths From Source to Target](en/1-1000/797-all-paths-from-source-to-target.md) was solved in_Python, Java, C++, JavaScript, C#, Go, Ruby_ and**2** ways.
107107
-[200. Number of Islands](en/1-1000/200-number-of-islands.md) was solved in_Python, Java, C++, JavaScript, C#, Go, Ruby_ and**3** ways.
108108
-[463. Island Perimeter](en/1-1000/463-island-perimeter.md) was solved in_Python_ and**2** ways.
109-
-[695. Max Area of Island](en/1-1000/695-max-area-of-island.md) was solved in_Python, Java, C++, JavaScript, C#, Go, Ruby_.
110-
-[827. Making A Large Island](en/1-1000/827-making-a-large-island.md) was solved in_Python_.
109+
-[695. Max Area of Island](en/1-1000/695-max-area-of-island.md) was solved in_Python, Java, C++, JavaScript, C#, Go, Ruby_ and**3** ways.
110+
-[827. Making A Large Island](en/1-1000/827-making-a-large-island.md) was solved in_Python_ and**2** ways.
111111
-[127. Word Ladder](en/1-1000/127-word-ladder.md) was solved in_Python_.
112112
-[1971. Find if Path Exists in Graph](en/1001-2000/1971-find-if-path-exists-in-graph.md) was solved in_Python, Java, C++, JavaScript, C#, Go, Ruby_ and 2 ways.
113113
-[684. Redundant Connection](en/1-1000/684-redundant-connection.md) was solved in_Python, Java, C++, JavaScript, C#, Go, Ruby_.
@@ -123,4 +123,6 @@ You can skip the more difficult problems and do them later.
123123
#Others
124124
-[433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in_Python_ and 2 ways.
125125

126+
TODO: Add A* for 433 and 127?
127+
126128
More LeetCode problems will be added soon.

‎en/1-1000/433-minimum-genetic-mutation.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -52,13 +52,13 @@ So this issue can be solved by **Breadth-First Search** on a undirected graph.
5252
* Time:`O((8 * 4) * N)`.
5353
* Space:`O(N)`.
5454

55-
###Solution 2: A* (A-Star) Algorithm
55+
###Solution 2: A* (A-Star)SearchAlgorithm
5656

57-
**A-Star Algorithm** can be used to improve the performance of**Breadth-First Search Algorithm**.
57+
**A-StarSearchAlgorithm** can be used to improve the performance of**Breadth-First Search Algorithm**.
5858

5959
Please view**A-Star Algorithm** at[752. Open the Lock](./752-open-the-lock.md).
6060

61-
Bellow is code using_A-Star Algorithm_ in Python.
61+
Bellow is code using_A-StarSearchAlgorithm_ in Python.
6262

6363
##Python
6464
###Solution 1: Breadth-First Search
@@ -101,7 +101,7 @@ class Solution:
101101
self.bank.remove(mutation)
102102
```
103103

104-
###Solution 2: A* (A-Star) Algorithm
104+
###Solution 2: A* (A-Star)SearchAlgorithm
105105
```python
106106

107107
```

‎en/3001-4000/unorganized.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -177,7 +177,8 @@ Add a table to show the differences between A-Start and breadth-first search
177177
- 399https://leetcode.com/problems/evaluate-division/ union-find
178178
- 1976https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/ both use Dijkstra or Bellman-Ford can solve it.
179179
- 1263https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/ A-star
180-
180+
-695. Max Area of Island 2 other ways should be added with code
181+
- 827 making-a-large-island breadth-first-search should be added with code
181182

182183
###Failed in 2 rounds
183184
- 222https://leetcode.cn/problems/count-complete-tree-nodes/

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp