Given a linked list, determine if it has a cycle in it.
此题目的在于判断一个链表是否是一个循环链表。
思路:
1.先定义两个节点指针first和second;
2.first每次走一步,second每次走两步;
3.若second && second->next为NULL,则返回false,此判断是因为如果second为NULL,则
second->next就会抛出异常,同样要判断second->next是否为NULL,不然second->next->next也会抛出异常;
4.否则,如果first == second ,则返回true。
/**
* 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 *first = head;
ListNode *second = head;
while(second && second->next){
first = first->next;
second = second->next->next;
if(first == second) return true;
}
return false;
}
};