题解 | #两个链表的第一个公共结点#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
#include <map>

class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
		std::map<ListNode*, bool> mem;
		for(auto cur = pHead1; cur; cur = cur->next) {
			mem.emplace(cur, true);
		}
		for(auto cur = pHead2; cur; cur = cur->next) {
			if(mem.count(cur)) return cur;
			mem.emplace(cur, true);
		}
		return nullptr;
    }
};