Commitb43e110

committed

Reworded.

1 parent83fde21 commitb43e110Copy full SHA for b43e110

File tree

+13

-6

lines changed

+13

-6

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -118,6 +118,7 @@ You can skip the more difficult problems and do them later.`
`118`	`118`	`-[743. Network Delay Time](en/1-1000/743-network-delay-time.md) was solved in_Python_ and 2 ways.`
`119`	`119`	`-[787. Cheapest Flights Within K Stops](en/1-1000/787-cheapest-flights-within-k-stops.md) was solved in_Python_.`
`120`	`120`	`-[1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](en/1001-2000/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md) was solved in_Python_.`
	`121`	`+-[752. Open the Lock](en/1-1000/752-open-the-lock.md) was solved in_Python_ and 2 ways.`
`121`	`122`
`122`	`123`	`#Others`
`123`	`124`	`-[433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in_Python_.`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -45,10 +45,10 @@ The word transformation sequence problem can be abstracted into a **graph th`
`45`	`45`	`###Breadth-First Search`
`46`	`46`	`![](../../images/binary_tree_BFS_1.gif)`
`47`	`47`
`48`		`-* As shown in the figure above,breadth-first search can be thought of as visiting vertices in rounds and rounds. Actually, whenever you see a question is about`
`49`		-getting`shortest` or`least` of something of a graph,`breadth-first search` would probably help.
	`48`	`+* As shown in the figure above,Breadth-First Search can be thought of as visiting vertices in rounds and rounds. Actually, whenever you see a question is about`
	`49`	+getting`minimum number` of something of a graph,`Breadth-First Search` would probably help.
`50`	`50`
`51`		-`breadth-first search` emphasizes first-in-first-out, so aqueue* is needed.
	`51`	+`Breadth-First Search` emphasizes first-in-first-out, so aqueue* is needed.
`52`	`52`
`53`	`53`	`##Approach`
`54`	`54`	1.`Breadth-First Search` a graph means traversingfrom near to far, from`circle 1` to`circle N`. Each`circle` is a round of iteration, but we can simplify it by using just 1 round.

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -65,9 +65,9 @@ Please click [Depth-First Search by Iteration Solution](200-number-of-islands-2.`
`65`	`65`	`##Solution 3: Breadth-First Search`
`66`	`66`	`![](../../images/binary_tree_BFS_1.gif)`
`67`	`67`
`68`		`-As shown in the figure above,breadth-first search can be thought of as visiting vertices in rounds and rounds.`
	`68`	`+As shown in the figure above,Breadth-First Search can be thought of as visiting vertices in rounds and rounds.`
`69`	`69`
`70`		`-It emphasizes first-in-first-out, so aqueue is needed.`
	`70`	+`Breadth-First Search` emphasizes first-in-first-out, so aqueue is needed.
`71`	`71`
`72`	`72`	`##Complexity`
`73`	`73`	* Time:`O(n * m)`.

Lines changed: 7 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -65,6 +65,8 @@ The improved way with a queue is commonly more efficient. Relaxing All Edges`
`65`	`65`	`\|Dijkstra's algorithm\|Vertices\|\|`
`66`	`66`	`\|Bellman-Ford algorithm\|Edges(Vertices+Edges for SPFA)\|\|`
`67`	`67`
	`68`	`+Add a table to show the differences between A-Start and breadth-first search`
	`69`	`+`
`68`	`70`	`##Others`
`69`	`71`	`* Find all the prime numbers within 1000000.`
`70`	`72`
`@@ -174,6 +176,8 @@ The improved way with a queue is commonly more efficient. Relaxing All Edges`
`174`	`176`	`- 417https://leetcode.com/problems/pacific-atlantic-water-flow/`
`175`	`177`	`- 399https://leetcode.com/problems/evaluate-division/ union-find`
`176`	`178`	`- 1976https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/ both use Dijkstra or Bellman-Ford can solve it.`
	`179`	`+- 1263https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/ A-star`
	`180`	`+`
`177`	`181`
`178`	`182`	`###Failed in 2 rounds`
`179`	`183`	`- 222https://leetcode.cn/problems/count-complete-tree-nodes/`
`@@ -192,4 +196,6 @@ The improved way with a queue is commonly more efficient. Relaxing All Edges`
`192`	`196`	`- 1514-path-with-maximum-probability.md`
`193`	`197`	`- 1334https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance`
`194`	`198`
`195`		`-2005-02-09 day 2`
	`199`	`+##other finished problems`
	`200`	`+-https://leetcode.com/problems/k-closest-points-to-origin/`
	`201`	`+-`

Comments

(0)