Linked List Cycle II (leetcode)

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

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:
    ListNode *detectCycle(ListNode *head) {
        if (!head || !head->next) {
			return NULL;
		}
		ListNode *slow = head;
		ListNode *fast = head;

		while (fast->next && fast->next->next) {
			slow = slow->next;
			fast = fast->next->next;
			if (slow == fast) {
				//it's a cycle linked list, set the slow  to the begin of this list
				slow = head;
				while (slow != fast) {
					slow = slow->next;
					fast = fast->next;
				}
				//this is the place where cycle begins
				return slow;
			}
		}
		return NULL;
    }
};