码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode:Linked List Cycle

时间:2015-08-31 13:18:58      阅读:141      评论:0      收藏:0      [点我收藏+]

标签:

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

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

 

 

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     bool hasCycle(ListNode *head) {
12         ListNode *slow=head;
13         ListNode *fast=head;
14         
15         while(fast&&fast->next)
16         {
17             slow=slow->next;
18             fast=fast->next->next;
19             if(slow==fast) return true;
20         }
21         return false;
22         
23     }
24 };

 

LeetCode:Linked List Cycle

标签:

原文地址:http://www.cnblogs.com/xiaoying1245970347/p/4772735.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!