160. 相交链表

/**
 * 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) {
        ListNode NodeA = headA , NodeB = headB, returnNode = null;
        int numA = 0, numB = 0, tmp = 0;
        while(NodeA != null)
        {
            numA++;
            NodeA = NodeA.next;
        }
        while(NodeB != null)
        {
            numB++;
            NodeB = NodeB.next;
        }
        if(numA > numB)
        {
            tmp = numA - numB;
            while(tmp > 0)
            {
                headA = headA.next;
                tmp--;
            }
            while(headA != null)
            {
                if(headA == headB)
                {
                    returnNode = headA;
                    return returnNode;
                }
                headA = headA.next;
                headB = headB.next;
            }
        }
        else
        {
            tmp = numB - numA;
            while(tmp > 0)
            {
                headB = headB.next;
                tmp--;
            }
            while(headB != null)
            {
                
                if(headB == headA)
                {
                    returnNode = headB;
                    return returnNode;
                }
                headB = headB.next;
                headA = headA.next;
            }
        }
        return returnNode; 
    }
}