LeetCode-160. 相交鏈表-Java實現

實現效果 public ListNode getIntersectionNode(ListNode headA, ListNode headB) { if(headA == null || headB == null) return null; ListNode pA = headA, pB = headB; while(pA != pB) {

>>阅读原文<<