首页 > 其他 > 详细

leetcode Linked List Cycle

时间:2014-06-02 08:05:36      阅读:392      评论:0      收藏:0      [点我收藏+]

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

Follow up:
Can you solve it without using extra space?

求链表是否有环的问题,要考虑链表为空的情况,定义一个快指针和一个慢指针,如果快指针和慢指针重合就表明有环

bubuko.com,布布扣
bool hasCycle(ListNode *head){
    if(head == NULL || head->next == NULL)  return false;
    ListNode* first = head, *second = head;
    while(second!=NULL && second->next!=NULL){
        first = first->next;
        second = second->next->next;
        if(first == second) return true;
    }
    return false;
}
bubuko.com,布布扣

 

 

leetcode Linked List Cycle,布布扣,bubuko.com

leetcode Linked List Cycle

原文:http://www.cnblogs.com/xiongqiangcs/p/3763897.html

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