【LeetCode】141. 环形链表

代码

方法1 hash表

class Solution {
public:
	bool hasCycle(ListNode* head) {
		//特判
		if (head == nullptr || head->next == nullptr) return false;
		unordered_map<ListNode*,int> list;
		ListNode* cur = head;
		while (cur)
		{
			if (list.find(cur) != list.end()) return true;
			list[cur]++;
			cur = cur->next;
		}
		return false;
	}
};

方法2 双指针

class Solution {
public:
	bool hasCycle(ListNode* head) {
		//特判
		if (head == nullptr || head->next == nullptr) return false;
		ListNode *slow = head;//慢指针
		ListNode* fast = head->next;//快指针
		while (slow!=fast)
		{
			if (fast == nullptr || fast->next == nullptr) return false;//fast已走为null或fast走一步已为null
			slow = slow->next;
			fast = fast->next->next;
		}
		return true;
	}
};