Leetcode 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.

---

[code]

public class Solution {
        public ListNode getIntersectionNode(ListNode headA, ListNode headB)
        {
                if(headA ==null || headB==null)return null;
                ListNode pa=headA, pb=headB;
                while(pa.next!=null)
                {
                    pa=pa.next;
                }
                ListNode tailA=pa;
                pa.next=headA;
                pa=headB.next;
                if(pa==null)
                {
                    tailA.next=null;
                    return headA==headB ? headA : null;
                }
                else pb=headB.next.next;
                while(pb!=null && pb.next!=null && pa!=pb)
                {
                    pa=pa.next;
                    pb=pb.next.next;
                }
                if(pa!=pb)
                {
                    tailA.next=null;
                    return null;
                }
                pa=headB;
                while(pa!=pb)
                {
                    pa=pa.next;
                    pb=pb.next;
                }
                tailA.next=null;
                return pa;
        }

}

[Thoughts]

• 上面的code很好理解，把A首尾相连转化成 linked list cycle II
• 另一种解法：When pA reaches the end of a list, then redirect it to the head of B (yes, B, that’s right.); similarly when pB reaches the end of a list, redirect it the head of A.