leetcode 日经贴,Cpp code -Linked List Cycle
2015-04-22 16:32
429 查看
Linked List Cycle
/** * 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) { if (!head || !head->next) { return false; } ListNode *p1 = head, *p2 = head->next; while (p1 != p2 && p2) { p1 = p1->next; if (p2->next) { p2 = p2->next->next; } else { p2 = p2->next; } } return p1 == p2; } };
相关文章推荐
- leetcode 日经贴,Cpp code -Linked List Cycle II
- leetcode 日经贴,Cpp code -Delete Node in a Linked List
- leetcode 日经贴,Cpp code -Palindrome Linked List
- leetcode 日经贴,Cpp code -Flatten Binary Tree to Linked List
- leetcode 日经贴,Cpp code -Reverse Linked List
- leetcode 日经贴,Cpp code -Remove Linked List Elements
- leetcode 日经贴,Cpp code -Reverse Linked List II
- [LeetCode] Linked List Cycle II, Solution
- leetcode: (141) Linked List Cycle
- Leetcode78: Linked List Cycle II
- Leetcode: Linked List Cycle
- 【LeetCode-面试算法经典-Java实现】【142-Linked List Cycle II(单链表中有环II)】
- 【LeetCode】【C++】Linked list cycle 2
- LeetCode | Linked List Cycle II
- [LeetCode]Linked List Cycle
- (LeetCode 141/142)Linked List Cycle
- [LeetCode] Linked List Cycle
- 【Leetcode】Linked List Cycle II
- LeetCode141:Linked List Cycle
- LeetCode-Linked List Cycle II -有环链表-推理