LeetCode_Linked List Cycle

石头_奋斗

于 2014-05-11 19:17:08 发布

阅读量573

点赞数

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

本文链接：https://blog.csdn.net/loveRooney/article/details/25558449

版权

LeetCode 专栏收录该内容

47 篇文章 0 订阅

订阅专栏

Given a linked list, determine if it has a cycle in it.

Follow up:

Can you solve it without using extra space?

/**
 * 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) {
        if (head==NULL)
        {
            return false;
        }
        
         ListNode *pSingleSpeed=head;
         ListNode *pDpubleSpeed=head;

         while (pSingleSpeed!=NULL&&pDpubleSpeed!=NULL)
         {
             pSingleSpeed=pSingleSpeed->next;
             pDpubleSpeed=pDpubleSpeed->next;
             if (pDpubleSpeed!=NULL)
             {
                 pDpubleSpeed=pDpubleSpeed->next;
             }
             else
             {
                 return false;
             }
             if (pSingleSpeed==pDpubleSpeed&&pSingleSpeed!=NULL
                 &&pDpubleSpeed!=NULL)
             {
                 return true;
             }
         }
         return false;    
    }
};