leetcode--009 Linked List Cycle I
2014-07-31 13:47
344 查看
public boolean hasCycle(ListNode head) { ListNode s=head; ListNode f=head; while(f!=null&&f.next!=null){ s=s.next; f=f.next.next; if(s==f){ return true; } } return false; }
相关文章推荐
- leetcode 之Linked List Cycle(24)
- 4.24 leetcode -24 linked-list-cycle
- leetcode笔记:Linked List Cycle 2
- LeetCode 141 Linked List Cycle
- 【LeetCode】141 Linked List Cycle (java实现)
- LeetCode Linked List Cycle II
- LeetCode 142 Linked List Cycle II
- leetcode linked-list-cycle(i 、ii)(java实现)
- leetCode-linkedListCycle判断链表是否有环
- LeetCode——linked-list-cycle-ii
- [leetcode]Linked List Cycle II
- <leetcode系列> Linked List Cycle
- [LeetCode 第10题] -- Linked List Cycle
- [LeetCode]Linked List Cycle II
- [LeetCode 第11题] -- Linked List Cycle II
- LeetCode: Linked List Cycle [141]
- (leetcode)Linked List Cycle II
- Leetcode Linked List Cycle II
- Leetcode | Linked List Cycle I && II
- [LeetCode]Linked List Cycle II解法学习