141. Linked List Cycle
2016-11-26 21:01
183 查看
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
这道题用两个指针指向表头,一个每次走一步,一个每次走两步,如果这个链表有环的话,那么快的指针会赶上慢的指针。
程序要防止指针为空的情况。
Follow up:
Can you solve it without using extra space?
这道题用两个指针指向表头,一个每次走一步,一个每次走两步,如果这个链表有环的话,那么快的指针会赶上慢的指针。
程序要防止指针为空的情况。
class Solution { public: bool hasCycle(ListNode *head) { ListNode *slow=head; ListNode *fast=head; while(slow&&fast&&fast->next!=NULL) { slow=slow->next; fast=fast->next->next; if(slow==fast) return true; } return false; } };
相关文章推荐
- leetcode-141-Linked List Cycle
- leetcode(141):Linked List Cycle
- 【LeetCode 141】Linked List Cycle(Python)
- 141 Linked List Cycle(判断链表是否有环Medium)
- Leetcode 141 Linked List Cycle
- LeetCode-Easy部分标签为LinkedList 141 Linked List Cycle
- leetcode 141-Linked List Cycle
- 141. Linked List Cycle
- 141、142 Linked List Cycle & II
- 【leetcode】【141】Linked List Cycle
- leetcode-Linked List Cycle-141
- 141. Linked List Cycle
- leetcode(141). Linked List Cycle
- 141. Linked List Cycle
- [leedcode 141] Linked List Cycle
- [leetcode 141] Linked List Cycle
- 141. Linked List Cycle
- 141. Linked List Cycle
- Leetcode 141 Linked List Cycle
- 【LeetCode】141 Linked List Cycle (java实现)