leetcode面试题02.07.链表相交

链表相交，交叉链表

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        //1.首先定义两个指针分别指向两个链表的头部
        ListNode p1 = headA;
        ListNode p2 = headB;
        //循环条件就是相交，即p1 != p2的情况下才可以继续向前推进
        while(p1 != p2) {
           
            if (p1 == null) {
                p1 = headB;
            } else {
                p1 = p1.next;
            }

            if (p2 == null) {
                p2 = headA;
            } else {
                p2 = p2.next;
            }

        }

        return p1;

    }
}