🌗 剑指 Offer 52. 两个链表的第一个公共节点

难度: 🌗

问题描述

---

解法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
class Solution {
    ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        // 思路：
        // 爱心
        ListNode a = headA;
        ListNode b = headB;
        while(a != b) {
            if(a != null) {
                a = a.next;
            } else {
                a = headB;
            }
            if(b != null) {
                b = b.next;
            } else {
                b = headA;
            }
        }
        return a;
    }
}

---

输出