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的方法