LeetCode OJ：Linked List Cycle（链表循环）

Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?

判断一个链表是否存在环，维护快慢指针就可以，如果有环那么快指针一定会追上慢指针，代码如下：

 1 class Solution {
 2 public:
 3     bool hasCycle(ListNode *head) {
 4         ListNode * slow, * fast;
 5         slow = fast = head;
 6         while(slow && fast){
 7             slow = slow->next;
 8             fast = fast->next;
 9             if(fast) fast = fast->next;
10             if(fast && slow && slow == fast)
11                 return true;
12         }
13         return false;
14     }
15 };

转载于:https://www.cnblogs.com/-wang-cheng/p/4934642.html

LeetCode OJ：Linked List Cycle（链表循环）相关推荐

Leetcode 142. Linked List Cycle II
地址:Leetcode 142. linked list Cycle II 问题描述:检测链表是否存在环,是的话返回环入口,否则返回None. 这道题有两个思路,一个是经典的快慢指针的思路,另外一个是 ...
Leetcode 142 Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
【To Do】LeetCode 142. Linked List Cycle II
LeetCode 142. Linked List Cycle II Solution1:我的答案这道题多次遇到,牢记此解法这道题要深思一下,快指针和慢指针的速度对比不同,会产生什么不同的结果? ...
LeetCode 142. Linked List Cycle II--单向链表成环的起点--C++,Python解法
题目地址:Linked List Cycle II - LeetCode Given a linked list, return the node where the cycle begins. If ...
LeetCode 141. Linked List Cycle （链表循环）
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using ex ...
[LeetCode] 141. Linked List Cycle 单链表判圆算法
TWO POINTER 快指针速度2 , 慢指针速度1 相对速度1,有环必然相遇 public class Solution {public boolean hasCycle(ListNode hea ...
【leetcode】Linked List Cycle I II
Given a linked list, determine if it has a cycle in it. Can you solve it without using extra space? ...
[LeetCode] 142. Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. 题意:找 ...
leetcode 141. Linked List Cycle
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using ex ...
Leetcode - 142. Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. 分析: ...

LeetCode OJ：Linked List Cycle（链表循环）

LeetCode OJ：Linked List Cycle（链表循环）相关推荐

最新文章

热门文章