题解 | #两个链表的第一个公共结点# 榜一大哥的解法好强

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

/**
 * 
 * @param pHead1 ListNode类 
 * @param pHead2 ListNode类 
 * @return ListNode类
 */
struct ListNode* FindFirstCommonNode(struct ListNode* pHead1, struct ListNode* pHead2 ) {
    // write code here
    struct ListNode *cur1,*cur2;
    int flag=0;
    for(cur1=pHead1;cur1!=NULL;cur1=cur1->next)
    {
        for(cur2=pHead2;cur2!=NULL;cur2=cur2->next)
        {
            if(cur1==cur2)
            {
                flag=1;
                break;
            }
            
        }
        if(flag==1)
            break;
    }
    if(flag==1)
    return cur1;
    else
    return NULL;
}