样题打印之链表

找出两个链表的交点

 

160. Intersection of Two Linked Lists (Easy)

A:          a1 → a2

                    ↘

                      c1 → c2 → c3

                    ↗

B:    b1 → b2 → b3

public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

    ListNode l1 = headA, l2 = headB;

    while (l1 != l2) {

        l1 = (l1 == null) ? headB : l1.next;

        l2 = (l2 == null) ? headA : l2.next;

    }

    return l1;

}

[LeetCode] Reverse Linked List 倒置链表

public ListNode reverseList(ListNode head) {
    if (head == null || head.next == null) {
        return head;
    }
    ListNode next = head.next;
    ListNode newHead = reverseList(next);
    next.next = head;
    head.next = null;
    return newHead;
}