[Leetcode]#141 Linked List Cycle

最新推荐文章于 2024-11-17 18:49:52 发布

jerseyma

最新推荐文章于 2024-11-17 18:49:52 发布

阅读量268

点赞数

分类专栏： linkedlist 文章标签： leetcode linkedlist

本文链接：https://blog.csdn.net/jerseyma/article/details/48173449

版权

linkedlist 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/linked-list-cycle/

//#141 Linked List Cycle
//12ms 100%
/**
 * 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 *p1(head), *p2(head);
        while(p2 != NULL && p2->next != NULL)
        {
            p1 = p1->next;
            p2 = p2->next->next;
            if(p1 == p2) return true;
        }
        return false;
    }

};