leetcode 相交列表

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB) {
    struct ListNode *n=headA;
    struct ListNode *m=headB;if(headA==headB){
        return headA;
    }
    while(n!=NULL){
            while(m!=NULL){
                if(n==m){return n;
                }
                else{
                    m=m->next;
                }
            }
            m=headB;
            n=n->next;
    }
    return NULL;
    
}

这是暴力遍历，很费时