/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        /*
        *编写一个程序，找到两个单链表相交的起始节点
        *如果两个链表没有交点，返回 null.
        */
        ListNode *pa = headA,*pb = headB;
        while(pa != pb) {
            pa = pa ? pa->next:headB;
            pb = pb ? pb->next:headA;
        }
        return pa;
    }
};