bool hasCycle(ListNode *head)
{
auto walker = head;
auto runner = head;
while(runner && runner->next)
{
walker = walker->next;
runner = runner->next->next;
if(walker == runner)
return true;
}
return false;
}
LeetCode题目2——判断给定的链表中是否有环
猜你喜欢
转载自blog.csdn.net/www_dong/article/details/114297058
今日推荐
周排行