Leedcode9-linked-list-cycle-i

判断链表是不是循环链表

#include<iostream>
#include<vector>
using namespace std;
/*
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?*/
struct ListNode {int val;ListNode *next;ListNode(int x) : val(x), next(NULL) {}
};
class Solution {  //我的思路 错误
public:bool hasCycle(ListNode *head) {ListNode* faster = head;ListNode* slower = head;while (faster->next->next != NULL && faster->next != NULL) {faster = faster->next->next;slower = slower->next;}if (faster==slower)return true;return false;}
};
class Solution {
public:bool hasCycle(ListNode *head) {if (head == NULL)return false;ListNode* faster = head;ListNode* slower = head;while(faster->next->next != NULL && faster->next != NULL) {slower = slower->next;faster = faster->next->next;if (faster == slower)return true;}return false;}
};

Leedcode9-linked-list-cycle-i相关推荐

Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
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 ...
141. Linked List Cycle
欢迎fork and star:Nowcoder-Repository-github 141. Linked List Cycle 题目 Given a linked list, determine ...
leetcode: Linked List Cycle II
http://oj.leetcode.com/problems/linked-list-cycle-ii/ Given a linked list, return the node where the ...
leetcode day5 -- Reorder List Linked List Cycle II
1. Reorder List Given a singly linked list L: L0→L1→-→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln ...
LeetCode 之 JavaScript 解答第141题 —— 环形链表 I（Linked List Cycle I）
Time:2019/4/7 Title: Linked List Cycle Difficulty: Easy Author:小鹿题目:Linked List Cycle I Given a lin ...
LeetCode141 Linked List Cycle. LeetCode142 Linked List Cycle II
链表相关题 141. Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can ...
leetcode - Linked List Cycle
题目:Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can you solv ...
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 142. Linked List Cycle II
地址:Leetcode 142. linked list Cycle II 问题描述:检测链表是否存在环,是的话返回环入口,否则返回None. 这道题有两个思路,一个是经典的快慢指针的思路,另外一个是 ...

Leedcode9-linked-list-cycle-i

Leedcode9-linked-list-cycle-i相关推荐

最新文章

热门文章