fix

OneCodeMonkey · OneCodeMonkey · commit becaa326f3fd · 2021-04-18T21:46:42.000+08:00
diff --git a/leetcode_solved/leetcode_0142_Linked_List_Cycle_II.java b/leetcode_solved/leetcode_0142_Linked_List_Cycle_II.java
@@ -3,7 +3,7 @@
  *     Memory Usage: 38.9 MB, less than 81.24% of Java online submissions for Linked List Cycle II.
  * 
  * 思路：快慢指针法。 细节的是需要证明当快慢两指针相遇时，慢指针再走一倍已走过的路程，最终会停在环处。
- * 复杂度：T:O(n), S:O(s)
+ * 复杂度：T:O(n), S:O(1)
  */
 /**
  * Definition for singly-linked list.

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@`
`3`	`3`	`* Memory Usage: 38.9 MB, less than 81.24% of Java online submissions for Linked List Cycle II.`
`4`	`4`	`*`
`5`	`5`	`* 思路：快慢指针法。细节的是需要证明当快慢两指针相遇时，慢指针再走一倍已走过的路程，最终会停在环处。`
`6`		`- * 复杂度：T:O(n), S:O(s)`
	`6`	`+ * 复杂度：T:O(n), S:O(1)`
`7`	`7`	`*/`
`8`	`8`	`/**`
`9`	`9`	`* Definition for singly-linked list.`