第 08 周 优化系统性能 -02 命题作业

public class ListNode {
    private int val;
    private ListNode next;
}
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
    if (headA == null || headB == null) {
        return null;
    }
    ListNode B = headB;
    while (headA != null) {
        while (headB != null) {
            if (headA == headB) {
                return headA;
            }
            headB = headB.getNext();
        }
        headA = headA.getNext();
        headB = B;
    }
    return null;
}
时间复杂度 : O(m,n)