[leetcode] Linked List Cycle
2014-09-15 12:34
330 查看
public boolean hasCycle(ListNode head) { ListNode slow, fast; slow = fast = head; while(slow != null && fast != null && fast.next != null) { slow = slow.next; fast = fast.next.next; if(slow == fast) { return true; } } return false; }
相关文章推荐
- leetcode-Linked List Cycle I & II
- LeetCode|Linked List Cycle II
- LeetCode题解:Linked List Cycle
- Linked List Cycle @Leetcode
- LeetCode - Linked List Cycle
- 【leetcode】Linked List Cycle
- [leetcode] Linked List Cycle
- 【leetcode】Linked List Cycle
- leetcode(141):Linked List Cycle
- [LeetCode][Java] Linked List Cycle
- [LeetCode] Linked List Cycle 与 Linked List Cycle II
- [LeetCode]Linked List Cycle
- Linked List Cycle【leetcode】
- leetcode - Linked List Cycle
- leetcode - Linked List Cycle II
- 【LeetCode】-Linked List Cycle
- leetcode -- Linked List Cycle II -- 重点
- [LeetCode] Linked List Cycle
- Leetcode:Linked List Cycle
- LeetCode - Linked List Cycle I &II