相交链表-链表

https://leetcode-cn.com/problems/intersection-of-two-linked-lists/

思路 ：拼接两个链表使他们长度相同 然后遍历两个链表

public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
　　if (headA == null || headB == null) return null;
　　ListNode curA = headA, curB = headB;
　　while (curA != curB) {
　　　　curA = (curA == null) ? headB : curA.next;
　　　　curB = (curB == null) ? headA : curB.next;

// 这段代码在两个链表不相交的时候会死循环
// curA = (curA.next == null) ? headB : curA.next;
// curB = (curB.next == null) ? headA : curB.next;

　　}
　　return curA;
}