力扣面试题 02.07. 链表相交

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        int sizeA=1;
        int sizeB=1;
        int size=0;
        ListNode curA=headA;
        ListNode curB=headB;
        //记录链表A的结点数
        while(curA!=null)
        {
          sizeA++;
          curA=curA.next;
        }
        curA=headA;
        //记录链表B的结点数
          while(curB!=null)
        {
          sizeB++;
          curB=curB.next;
        }
        curB=headB;
        //链表A结点数多，移动curA指针到和链表B对齐的位置
        if(sizeA>sizeB)
        {
            size=sizeA-sizeB;
            while(size!=0)
            {
                curA=curA.next;
                size--;
            }
        }
        //链表B结点数多，移动curB指针到和链表A对齐的位置
        else{
               size=sizeB-sizeA;
            while(size!=0)
            {
                curB=curB.next;
                size--;
            }
        }
        //cueA和curB位置相同，说明此时在两个单链表相交的起始节点
        // 结束循环
        while(curA!=null&&curB!=null&&curA!=curB)
        {
            curA=curA.next;
            curB=curB.next;
        }
        //返回两个单链表相交的起始节点
        return curA;
    }
}