首页 > 其他 > 详细

Linked List Cycle II || LeetCode

时间:2015-06-13 06:17:18      阅读:215      评论:0      收藏:0      [点我收藏+]
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode *detectCycle(struct ListNode *head) {
    struct ListNode *fast,*slow;
    bool   flag;
    fast=slow=head,flag=false;
    while(fast&&slow){
        if(fast)fast=fast->next;
        if(fast)fast=fast->next;
        if(slow)slow=slow->next;
        if(fast==slow&&fast!=NULL){
            flag=true;
            break;
        }
    }
    if(flag==false)return NULL;
    slow=head;
    while(slow!=fast){
        slow=slow->next;
        fast=fast->next;
    }
    return slow;
}

  

Linked List Cycle II || LeetCode

原文:http://www.cnblogs.com/ProtectedDream/p/4572854.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!