链表是否有环
p1 = p2 = h;
do{
p1 = p1 ->next;
p2 = p2 ->next ->next;
}while(p2||p2->next||p1 == p2);
if(p1 == p2)
return true;
eles
return false;
新闻标题:链表是否有环
网站路径:http://jxjierui.cn/article/jjdppd.html


咨询
建站咨询
