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;
链表是否有环
猜你喜欢
转载自blog.51cto.com/13645380/2155597
今日推荐
周排行