Update: Linked List Cycle

Author: openset

problems/linked-list-cycle/linked_list_cycle.go

@@ -10,8 +10,8 @@ import . "github.com/openset/leetcode/internal/kit"
  * }
  */
 func hasCycle(head *ListNode) bool {
-	for p1, p2 := head, head; p1 != nil; p1 = p1.Next {
-		if p2 != nil && p2.Next != nil {
+	for p1, p2 := head, head; p1 != nil && p2 != nil; p1 = p1.Next {
+		if p2.Next != nil {
 			if p2 = p2.Next.Next; p1 == p2 {
 				return true
 			}

problems/linked-list-cycle/linked_list_cycle_test.go

@@ -24,6 +24,11 @@ func TestHasCycle(t *testing.T) {
 			pos:      0,
 			expected: true,
 		},
+		{
+			input:    []int{1, 2, 3, 4, 5},
+			pos:      -1,
+			expected: false,
+		},
 		{
 			input:    []int{1},
 			pos:      -1,