fixed link of linked-list-cycle-ii

dashidhy · web-flow · commit fd9e8c6fd34a · 2020-06-23T03:06:20.000-07:00
diff --git a/data_structure/linked_list.md b/data_structure/linked_list.md
@@ -389,7 +389,7 @@ func hasCycle(head *ListNode) bool {
 }
 ```
 
-### [linked-list-cycle-ii](https://leetcode-cn.com/problems/https://leetcode-cn.com/problems/linked-list-cycle-ii/)
+### [linked-list-cycle-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/)
 
 > 给定一个链表，返回链表开始入环的第一个节点。  如果链表无环，则返回  `null`。
 

Original file line number	Diff line number	Diff line change
`@@ -389,7 +389,7 @@ func hasCycle(head *ListNode) bool {`
`389`	`389`	`}`
`390`	`390`	```
`391`	`391`
`392`		`-### [linked-list-cycle-ii](https://leetcode-cn.com/problems/https://leetcode-cn.com/problems/linked-list-cycle-ii/)`
	`392`	`+### [linked-list-cycle-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/)`
`393`	`393`
`394`	`394`	> 给定一个链表，返回链表开始入环的第一个节点。如果链表无环，则返回 `null`。
`395`	`395`