Commitb8572cb

committed

Adjusted README.md.

1 parente6a9caf commitb8572cbCopy full SHA for b8572cb

File tree

-4

lines changed

-4

lines changed

Lines changed: 0 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -127,6 +127,4 @@ You can skip the more difficult problems and do them later.`
`127`	`127`	`#Others`
`128`	`128`	`-[433. Minimum Genetic Mutation](en/1-1000/433-minimum-genetic-mutation.md) was solved in_Python_ and 3 ways.`
`129`	`129`
`130`		`-TODO: Add A* for 127?`
`131`		`-`
`132`	`130`	`More LeetCode problems will be added soon.`

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -199,7 +199,7 @@ Add a table to show the differences between A-Start and breadth-first search`
`199`	`199`	`- 1584-min-cost-to-connect-all-points-2.md`
`200`	`200`	`- 1514-path-with-maximum-probability.md`
`201`	`201`	`- 1334https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance`
`202`		`-- 752 a star`
	`202`	`+- 752 a star Add A* for 127?`
`203`	`203`	`- 3464https://leetcode.cn/problems/maximize-the-distance-between-points-on-a-square`
`204`	`204`	`-https://leetcode.cn/problems/closest-equal-element-queries/`
`205`	`205`	`-https://leetcode.cn/problems/rotate-array`
`@@ -232,7 +232,8 @@ Add a table to show the differences between A-Start and breadth-first search`
`232`	`232`
`233`	`233`	`##Other algorithm`
`234`	`234`	`* 线段树https://leetcode.cn/problems/fruits-into-baskets-iii`
`235`		`-*`
	`235`	`+`
	`236`	`+`
`236`	`237`
`237`	`238`
`238`	`239`	`https://leetcode.cn/problems/closest-equal-element-queries`

Comments

(0)