LeetCode(160) Intersection of Two Linked Lists

题目如下：

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3
begin to intersect at node c1.

Notes:

If the two linked lists have no intersection at all, return null.
The linked lists must retain their original structure after the function returns.
You may assume there are no cycles anywhere in the entire linked structure.
Your code should preferably run in O(n) time and use only O(1) memory.

分析如下：

这道题目其实和之前的一道题目 Linked List Cycle II 一样，只需要把这道题目中的一条list的尾巴连接到另一条list的头部，就变成了Linked List Cycle II这道题目了。

我的代码：

//288ms 
class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        ListNode* fast = head;
        ListNode* slow = head;
        while (slow != NULL && fast != NULL) {
            slow = slow->next;
            fast = fast->next;
            if(fast != NULL)
                fast = fast->next;
            if (fast == slow)
                break;
        }
        if (fast == NULL) return NULL;
        slow = head;
        while (slow != fast) {
            slow = slow->next;
            fast = fast->next;
        }
        return fast;
    }
    
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* keepHeadB = headB;
        ListNode* keepTailB = headB;
        if (headA == NULL || headB == NULL) return NULL;
        while (headB->next != NULL) 
            headB = headB->next;
        keepTailB = headB;    
        headB->next = headA;
        ListNode* cycleBegin = detectCycle(keepHeadB);
        keepTailB->next = NULL;
        return cycleBegin;
    }
};