141. Linked List Cycle LeetCode
2016-02-13 18:19
316 查看
题意：给出一个链表，判断是否有环。
题解：用两个指针，一个是slow，一个是fast。slow每次走一步，fast每次走两步。当fast == slow的时候就说明有环。
题解：用两个指针，一个是slow，一个是fast。slow每次走一步，fast每次走两步。当fast == slow的时候就说明有环。
class Solution {
public:
bool hasCycle(ListNode *head) {
ListNode *slow,*fast;
slow = head,fast = head;
do
{
if(!slow || !fast)
return false;
fast = fast->next;
slow = slow->next;
if(!fast) return false;
else fast = fast->next;
}
while(slow != fast);
return true;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解