@@ -26,7 +26,7 @@ Return `true` if there is a cycle in the linked list. Otherwise, return `false`.
26
26
27
27
28
28
** example 1**
29
- ![ test 1] ( https://github.com/SherlockUnknowEn/leetcode/tree /master/60-69/60.%20Linked%20List%20Cycle(Easy)/circularlinkedlist.png )
29
+ ![ test 1] ( https://github.com/SherlockUnknowEn/leetcode/blob /master/60-69/60.%20Linked%20List%20Cycle(Easy)/circularlinkedlist.png )
30
30
31
31
```
32
32
Input: head = [3,2,0,-4], pos = 1
@@ -37,7 +37,7 @@ Explanation: There is a cycle in the linked list, where the tail connects to the
37
37
38
38
39
39
** example 2**
40
- ![ test 2] ( https://github.com/SherlockUnknowEn/leetcode/tree /master/60-69/60.%20Linked%20List%20Cycle(Easy)/circularlinkedlist_test2.png )
40
+ ![ test 2] ( https://github.com/SherlockUnknowEn/leetcode/blob /master/60-69/60.%20Linked%20List%20Cycle(Easy)/circularlinkedlist_test2.png )
41
41
42
42
```
43
43
Input: head = [1,2], pos = 0
@@ -47,7 +47,7 @@ Explanation: There is a cycle in the linked list, where the tail connects to the
47
47
```
48
48
49
49
** example 3**
50
- ![ test 3] ( https://github.com/SherlockUnknowEn/leetcode/tree /master/60-69/60.%20Linked%20List%20Cycle(Easy)/circularlinkedlist_test3.png )
50
+ ![ test 3] ( https://github.com/SherlockUnknowEn/leetcode/blob /master/60-69/60.%20Linked%20List%20Cycle(Easy)/circularlinkedlist_test3.png )
51
51
52
52
```
53
53
Input: head = [1], pos = -1
0 commit comments