160. Intersection of Two Linked Lists

原用方法：用迴圈以及遞迴來找Node內資料，但會RunTime Exceeded

Solution

之後使用方法：2 pointers

public class Solution {
    ListNode result = null;
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        ListNode a = headA;
        ListNode b = headB;
        if(a == null || b == null){
            return null;
        }
        while(a != b){
            a= a == null? headB: a.next;
            b= b == null? headA: b.next;
        }
        return a;
    }
}