［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 extra space?

让head不断走一步，如果cur不为null，走两步，这样如果存在cycle，cur会追上head。

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     ListNode *next;*     ListNode(int x) : val(x), next(NULL) {}* };*/
class Solution {
public:bool hasCycle(ListNode *head) {ListNode* cur = head;while (cur && cur->next != head){cur = cur->next;if (cur)cur = cur->next;elsebreak;head = head->next;}if (!cur) return false;return true;}
};

转载于:https://www.cnblogs.com/Doctengineer/p/5838647.html

［Leetcode］141. Linked List Cycle相关推荐

141. Linked List Cycle
欢迎fork and star:Nowcoder-Repository-github 141. Linked List Cycle 题目 Given a linked list, determine ...
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 python3 简单题141. Linked List Cycle
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百四十一题 (1)题目英文: Given a linked list, det ...
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 Given a linked list, determine if it has a cycle in it. To
文章目录前言正文原题: 思路1: 思路2 思路3 总结前言今天这道题目的第一种解法很奇葩,用计时器竟然可以AC,并且可以自己调整时间多少,跟我一起来看看吧. 正文原题: 链接:环形链表 G ...
[LeetCode] 141. Linked List Cycle 单链表判圆算法
TWO POINTER 快指针速度2 , 慢指针速度1 相对速度1,有环必然相遇 public class Solution {public boolean hasCycle(ListNode hea ...
LeetCode 141 Linked List Cycle
用快慢指针来判定是否有环. 这里while loop里的条件,用的是fast.next != null && fast.next.next != null,保证如果没有环,slow一定 ...
【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 ...
［Leetcode］50. Pow(x, n)
Implement pow(x, n). 我的做法就比较傻了.排除了所有的特殊情况(而且double一般不可以直接判断==),然后常规情况用循环来做.- -||| 直接用循环,时间复杂度就比较大.应该 ...

［Leetcode］141. Linked List Cycle

［Leetcode］141. Linked List Cycle相关推荐

最新文章

热门文章