Commiteaaf92d

committed

update readme

1 parentd3525f5 commiteaaf92dCopy full SHA for eaaf92d

File tree

+12

-2

lines changed

+12

-2

lines changed

Lines changed: 10 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -85,8 +85,17 @@`
`85`	`85`
`86`	`86`	`[我看过的 100 本书](https://github.com/greyireland/awesome-programming-books-1)`
`87`	`87`
`88`		`-##后续`
	`88`	`+##更新计划`
`89`	`89`
`90`	`90`	`持续更新中，觉得还可以的话点个star 收藏呀 ⭐️~`
`91`	`91`
`92`	`92`	`【 Github 】[https://github.com/greyireland/algorithm-pattern](https://github.com/greyireland/algorithm-pattern) ⭐️`
	`93`	`+`
	`94`	`+##完成打卡`
	`95`	`+`
	`96`	`+完成计划之后，可以提交 Pull requests，在下面添加自己的项目仓库，完成自己的算法模板打卡呀~`
	`97`	`+`
	`98`	`+\| 完成\| 用户\| 项目地址\|`
	`99`	`+\| ----\| -------------------------------------------------\| -------------------------------------------------------------------\|`
	`100`	`+\| ✅\|[wardseptember](https://github.com/wardseptember)\|[notes(Java 实现)](https://github.com/wardseptember/notes)\|`
	`101`	`+\| 🕒\|[dashidhy](https://github.com/dashidhy)\|[algorithm-pattern-python(Python 实现)](https://github.com/dashidhy/algorithm-pattern-python)\|`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -379,7 +379,8 @@ func hasCycle(head *ListNode) bool {`
`379`	`379`	`fast:= head.Next`
`380`	`380`	`slow:= head`
`381`	`381`	`for fast !=nil && fast.Next !=nil {`
`382`		`-if fast.Val == slow.Val {`
	`382`	`+// 比较指针是否相等（不要使用val比较！）`
	`383`	`+if fast == slow {`
`383`	`384`	`returntrue`
`384`	`385`	`}`
`385`	`386`	`fast = fast.Next.Next`

Comments

(0)