两个链表的第一个公共结点。。。大腿的精妙程序

题目描述
输入两个链表，找出它们的第一个公共结点。

//第一种：我的思路是扔进vector里倒着看
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        vector<ListNode*>a,b;
        ListNode* p1=pHead1;
        ListNode* p2=pHead2;
        while(pHead1){
            a.push_back(pHead1);
            pHead1=pHead1->next;
        }
        while(pHead2){
            b.push_back(pHead2);
            pHead2=pHead2->next;
        }
        while(!a.empty()&&!b.empty()&&a.back()==b.back()){
            a.pop_back();
            b.pop_back();
        }
        if(a.empty())
            return p1;
        if(b.empty())
            return p2;
        return a.back()->next;
    }
};

---

//第二种：算长度，长的先走多的那几步，前面有一道题目也是这思路。
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode *pHead1, ListNode *pHead2) {
        int len1 = findListLenth(pHead1);
        int len2 = findListLenth(pHead2);
        if(len1 > len2){
            pHead1 = walkStep(pHead1,len1 - len2);
        }else{
            pHead2 = walkStep(pHead2,len2 - len1);
        }
        while(pHead1 != NULL){
            if(pHead1 == pHead2) return pHead1;
            pHead1 = pHead1->next;
            pHead2 = pHead2->next;
        }
        return NULL;
    }

    int findListLenth(ListNode *pHead1){
        if(pHead1 == NULL) return 0;
        int sum = 1;
        while(pHead1 = pHead1->next) sum++;
        return sum;
    }

    ListNode* walkStep(ListNode *pHead1, int step){
        while(step--){
            pHead1 = pHead1->next;
        }
        return pHead1;
    }
};

---

//第三种：抱大腿，好好参考
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode *pHead1, ListNode *pHead2) {
        ListNode *p1 = pHead1;
        ListNode *p2 = pHead2;
        while(p1!=p2){
            p1 = (p1==NULL ? pHead2 : p1->next);
            p2 = (p2==NULL ? pHead1 : p2->next);
        }
        return p1;
    }
};