Linked List Cycle
2017-01-28 20:00
281 查看
判断链表有没有环,可以用追击问题,一个走两步,一个走一
4000
步,如果能碰一起就是有环。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode *l1=head;
ListNode *l2=head;
while(l1&&l1->next&&l1->next->next)
{
l1=l1->next->next;
l2=l2->next;
if(l1==l2)
return true;
}
return false;
}
};
4000
步,如果能碰一起就是有环。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode *l1=head;
ListNode *l2=head;
while(l1&&l1->next&&l1->next->next)
{
l1=l1->next->next;
l2=l2->next;
if(l1==l2)
return true;
}
return false;
}
};
相关文章推荐
- LeetCode OJ:Linked List Cycle II(循环链表II)
- [Leetcode]Linked List Cycle
- Linked List Cycle
- Linked List Cycle II
- [C语言][LeetCode][142]Linked List Cycle II
- 020-142-Linked List Cycle II 判断链表是否有环并返回环的起点
- Linked List Cycle II
- [LeetCode] [快慢指针] Linked List Cycle
- Linked List Cycle II (LeetCode)
- LeetCode: Linked List Cycle I & II
- leetcode - Linked List Cycle II
- 《leetCode》:Linked List Cycle II
- 【leetcode】Linked List Cycle
- Leetcode_num7_Linked List Cycle
- Linked List Cycle II--LeetCode
- LeetCode 142 Linked List Cycle II
- [Leetcode] Linked List Cycle II
- Linked List Cycle I & II
- 第10题 Linked List Cycle II
- LeetCode|Linked List Cycle