public class Solution {
public boolean hasCycle(ListNode head) {
ListNode fast = head;
ListNode slow = head;
while(fast!=null&&fast.next!=null){
fast=fast.next.next;
slow=slow.next;
if(slow==fast)
return true;
}
return false;
}
}
LeetCode热题Hot-18 判断链表是否有环
最新推荐文章于 2024-06-01 22:16:46 发布