LeetCode Linked List Cycle II

最新推荐文章于 2020-10-11 10:29:54 发布

kassical

最新推荐文章于 2020-10-11 10:29:54 发布

阅读量546

点赞数

分类专栏： LeetCode 文章标签：数据机构 leetcode 链表

本文链接：https://blog.csdn.net/kassical/article/details/37845531

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

Follow up:

Can you solve it without using extra space?

/**
 * 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 **pNode) {
		if (head == NULL || head->next == NULL)
			return false;
		ListNode *pHead = head, *pAfter = head;
		while (pHead != NULL && pHead->next != NULL) {
			pHead = pHead->next->next;
			pAfter = pAfter->next;

			if (pHead == pAfter)
				break;
		}

		*pNode = pHead;
		if (pHead == pAfter)
			return true;
		else
			return false;
	}

	ListNode *detectCycle(ListNode *head) {
		ListNode *pNode = NULL, *pHead = head;
		if (hasCycle(head, &pNode)) {
			while (pNode != pHead) {
				pNode = pNode->next;
				pHead = pHead->next;
			}
			return pHead;
		}
		else
			return NULL;
	}
};