Function main

160. Intersection of Two Linked Lists/Solution.cpp:46–67

};

int main(int argc, char const *argv[])
{
    ListNode n1 = ListNode(1);
    ListNode n3 = ListNode(3);
    ListNode n5 = ListNode(5);
    ListNode n7 = ListNode(7);
    ListNode n9 = ListNode(9);
    ListNode n11 = ListNode(11);
    ListNode n2 = ListNode(2);
    ListNode n4 = ListNode(4);
    n1.next = &n3;
    n3.next = &n5;
    n5.next = &n7;
    n7.next = &n9;
    n9.next = &n11;
    n2.next = &n4;
    n4.next = &n9;
    Solution a;
    assert(a.getIntersectionNode(&n1, &n2) == &n9);
    
    return 0;
}