Leetcode 160. Intersection of Two Linked Lists（找出两个链表的交点，假设链表不带环）

Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly
linked lists begins.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        if(headA==NULL||headB==NULL){
            return NULL;
        }
        int len1=getlength(headA);
        int len2=getlength(headB);
        ListNode*pfast;
        ListNode*pslow;
        int dif;
        if(len1>len2){
            pfast=headA;
            pslow=headB;
            dif=len1-len2;
        }
        else{
            pfast=headB;
            pslow=headA;
            dif=len2-len1;
        }
        for(int i=0;i<dif;i++){
            pfast=pfast->next;
        }
        while(pfast!=NULL&&pslow!=NULL&&pfast!=pslow){
            pfast=pfast->next;
            pslow=pslow->next;
        }
        return pfast;
        
    }
private:
    int getlength(ListNode*head){
        int k=0;
        while(head!=NULL){
            head=head->next;
            k++;
        }
        return k;
    }
};