141.linked list cycle
2017-08-21 15:57
393 查看
/*
判断输入的链表是否是循环链表
思路:利用快慢指针,一个是p = p->next;另外一个是q = q->next;如果两个指针相遇了,则说明是循环链表
*/
//解法一 22% 6ms
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
bool hasCycle(struct ListNode *head) {
struct ListNode* p;
struct ListNode* q;
p = head;
q = head;
if(!head)
return false;
while(p!=NULL&&q!=NULL&&q->next)
{
p = p->next;
q = q->next->next;
if(p==q)
return true;
}
return false;
}
判断输入的链表是否是循环链表
思路:利用快慢指针,一个是p = p->next;另外一个是q = q->next;如果两个指针相遇了,则说明是循环链表
*/
//解法一 22% 6ms
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
bool hasCycle(struct ListNode *head) {
struct ListNode* p;
struct ListNode* q;
p = head;
q = head;
if(!head)
return false;
while(p!=NULL&&q!=NULL&&q->next)
{
p = p->next;
q = q->next->next;
if(p==q)
return true;
}
return false;
}
相关文章推荐
- 141. Linked List Cycle
- leetcode_c++:链表:Linked List Cycle(141)
- leetcode[141]Linked List Cycle
- LeetCode(141)——Linked List Cycle
- LeetCode 141 Linked List Cycle
- [C语言][LeetCode][141]Linked List Cycle
- 【LeetCode-面试算法经典-Java实现】【141-Linked List Cycle(单链表中有环)】
- LeetCode 141: Linked List Cycle
- 141. Linked List Cycle
- LeetCode-141 Linked List Cycle
- LeetCode 141 Linked List Cycle
- LeetCode 141 Linked List Cycle
- 【LeetCode】141 - Linked List Cycle
- 141. Linked List Cycle
- 【LeetCode】141 Linked List Cycle (java实现)
- 141 Linked List Cycle(判断链表是否有环Medium)
- 141. Linked List Cycle
- 【Leetcode-Easy-141】Linked List Cycle
- leetcode 141 Linked List Cycle
- LeetCode(141)Linked List Cycle