mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-24 00:57:05 +08:00
新增 141. 环形链表 JavaScript解法
This commit is contained in:
@ -114,6 +114,17 @@ class Solution:
|
||||
## JavaScript
|
||||
|
||||
```js
|
||||
var hasCycle = function(head) {
|
||||
let fast = head;
|
||||
let slow = head;
|
||||
// 空链表、单节点链表一定不会有环
|
||||
while(fast != null && fast.next != null){
|
||||
fast = fast.next.next; // 快指针,一次移动两步
|
||||
slow = slow.next; // 慢指针,一次移动一步
|
||||
if(fast === slow) return true; // 快慢指针相遇,表明有环
|
||||
}
|
||||
return false; // 正常走到链表末尾,表明没有环
|
||||
};
|
||||
```
|
||||
|
||||
-----------------------
|
||||
|
Reference in New Issue
Block a user