Commit b087f68

committed

修复66 链接打不开的bug

1 parent 70afb38 commit b087f68Copy full SHA for b087f68

File tree

-2

lines changed

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,7 @@ You should preserve the original relative order of the nodes in each of the`
`25`	`25`
`26`	`26`	`example 1`
`27`	`27`
`28`		`-![example 1](https://github.com/SherlockUnknowEn/leetcode/blob/master/60-69/66.%20Patition%20List(Medium)/patition.jpg)`
	`28`	`+![example 1](https://github.com/SherlockUnknowEn/leetcode/blob/master/60-69/66.%20Partition%20List(Medium)/partition.jpg)`
`29`	`29`
`30`	`30`	```
`31`	`31`	`Input: head = [1,4,3,2,5,2], x = 3`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -66,4 +66,4 @@`
`66`	`66`
`67`	`67`	`##### 65. [83.Remove Duplicates from Sorted List](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/65.%20Remove%20Duplicates%20from%20Sorted%20List(Easy)) 删除排序链表中的重复元素`
`68`	`68`
`69`		`-##### 65. [86.Partition List](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/66.%20Patition%20List(Medium)) 分隔链表`
	`69`	`+##### 65. [86.Partition List](https://github.com/SherlockUnknowEn/leetcode/tree/master/60-69/66.%20Partition%20List(Medium)) 分隔链表`

Comments

(0)