-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
84 lines (64 loc) · 1 KB
/
main.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
package main
import "fmt"
type ListNode struct {
Val int
Next *ListNode
}
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func hasCycle(head *ListNode) bool {
nextNode := head
for nextNode != nil && head != nil {
if nextNode.Next == nil || head.Next == nil {
return false
}
head = head.Next
nextNode = nextNode.Next.Next
if head == nextNode {
return true
}
}
return false
}
func hasCycle1(head *ListNode) bool {
nextNode := head
for nextNode != nil && head != nil && nextNode.Next != nil {
head = head.Next
nextNode = nextNode.Next.Next
if head == nextNode {
return true
}
}
return false
}
func main() {
l3 := &ListNode{
Val: 3,
Next: nil,
}
l2 := &ListNode{
Val: 2,
Next: l3,
}
l1 := &ListNode{
Val: 1,
Next: l2,
}
l0 := &ListNode{
Val: 0,
Next: l1,
}
l3.Next = l2
//fmt.Println(l0)
//
//l4 := &ListNode{
// Val: 0,
// Next:nil,
//}
fmt.Println(hasCycle1(l0))
}