LeetCode-Algorithms-[Easy][双指针][A]160. 相交链表

正好是今年南大初试题的plus版

方法1：比较好想

	public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
		HashSet<ListNode> set = new HashSet<ListNode>();
		while (headA != null) {
			set.add(headA);
			headA = headA.next;
		}
		while (headB != null) {
			if (set.contains(headB)) {
				return headB;
			}
			headB = headB.next;
		}
		return null;
	}

方法2：双指针

 

LeetCode题解：

图解相交链表

 

附上带文豪老哥的评论

	// 双指针法
	public ListNode getIntersectionNode_2(ListNode headA, ListNode headB) {
		if (headA == null || headB == null) {
			return null;
		}
		ListNode pA = headA, pB = headB;
		while (pA != pB) {
			pA = pA == null ? headB : pA.next;
			pB = pB == null ? headA : pB.next;
		}
		return pA;
	}