/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {boolean}
*/
var hasCycle = function(head) {
let slow = head
let fast = head
if(head==null||head.next==null){
return false
}
while(fast!=null && fast.next!=null){
slow = slow.next
fast = fast.next.next
if(slow==fast){
return true
}
}
return false
};
LeetCode 环形链表
最新推荐文章于 2022-05-15 00:15:38 发布