leetcode--160 intersection of two linked list

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

For example, the following two linked lists:

A: a1 → a2
↘
c1 → c2 → c3
↗
B: b1 → b2 → b3
begin to intersect at node c1.

Notes:

If the two linked lists have no intersection at all, return null.
The linked lists must retain their original structure after the function returns.
You may assume there are no cycles anywhere in the entire linked structure.
Your code should preferably run in O(n) time and use only O(1) memory.

一句话总结：寻找并返回两个单链表的交叉会和的节点。
思路：首先想到的就是两个单链表的尾部倒着看，一定是相同的，有一个后进先出的顺序。那么将两个单链表压入栈，比较栈顶，相同，出栈，继续比较，直到两个不同，那么交叉会和的就是上一个点。
但是需要的空间为O(n+m)。
此处需要的是O(1)。
那么先遍历单链表求得长度，让长的链表先走长度差的步数，然后进行每一步对比指针和值，如果都相同的就是。
时间52ms。
代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

    int getLen(ListNode *head)//遍历得到单链表长度
    {

        int len=0;
        ListNode* ptr=head;
        if(head == NULL)
        return len;
        while(ptr != NULL)
        {
            len++;
            ptr = ptr->next;
        }
        return len;
    }

    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        int len1 = getLen(headA);
        int len2 = getLen(headB);
        if(len1==0 || len2 == 0)
        return NULL;
        int diff= (len1 > len2) ? (len1-len2) : (len2-len1);

        ListNode* ptr=NULL;
        ListNode* ptr1=NULL;
        if(len1 > len2)
        {
            ptr = headA;
            ptr1 = headB;
        }
        else
        {
            ptr = headB;
            ptr1 = headA;
        }

        for(int i=0; i < diff ; i++)
        {
            ptr = ptr->next;
        }
        ListNode* ptr2=NULL;
        while(ptr != NULL && ptr1 != NULL  )//从头开始遍历，找到第一个相同的点
        {
            if( ptr->val == ptr1->val && ptr == ptr1)//指针相同并且值相同
            {
                ptr2 = ptr;
                break;
            }
            ptr = ptr->next;
            ptr1 = ptr1->next;
        }
        return ptr2;
    }
};