LeetCode - 160. Intersection of Two Linked Lists

代碼如下：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        if(headA == null || headB == null) return null;
        
        ListNode a = headA;
        ListNode b = headB;
        
        while(a != b){
            a = (a == null)? headB : a.next;
            b = (b == null)? headA : b.next;
        }
        
        return a;
    }
}

知識點：

1. 注意這種traverse到end然後轉換linked list的方法