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

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

/**
 * 
 * @param pHead1 ListNode类 
 * @param pHead2 ListNode类 
 * @return ListNode类
 */
#include <stdlib.h>
struct ListNode* FindFirstCommonNode(struct ListNode* pHead1, struct ListNode* pHead2 ) {
    struct ListNode* cur=pHead1;
    while (pHead2) {
        while (cur) {
            if (cur==pHead2) {
                return cur;
            }
            cur=cur->next;
        }
        pHead2=pHead2->next;
        cur=pHead1;
    }
    return NULL;
}