leetcode(160)

最新推荐文章于 2024-05-02 17:55:52 发布

人生体验

最新推荐文章于 2024-05-02 17:55:52 发布

阅读量111

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_43384504/article/details/106153765

版权

Leetcode 专栏收录该内容

10 篇文章 1 订阅

订阅专栏

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 //使用stl 的set
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        std::set<ListNode*> node_set;
        while(headA){
            node_set.insert(headA);
            headA=headA->next;
        }while(headB){
            if(node_set.find(headB)!=node_set.end()){
                return headB;
            }
            headB=headB->next;
        }
        return NULL;
    }
};

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

int get_list_length(ListNode *head)
{
    int len = 0;
    while(head)
    {
        head=head->next;
        len++;
    }
    return len;
}

ListNode *forward_long_list(int long_len,int short_len,ListNode *head)
{
    int delta = long_len-short_len;
    while(head&&delta)
    {
        head=head->next;
        delta--;
    }
    return head;
}


class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        int list_A_len =get_list_length(headA);
        int list_B_len =get_list_length(headB);
        if(list_A_len>=list_B_len){
            headA=forward_long_list(list_A_len,list_B_len,headA);
        }else{
            headB=forward_long_list(list_B_len,list_A_len,headB);
        }
        while(headA&&headB){
            if(headB==headA){
                 return headA;
            }
           headA=headA->next;
           headB=headB->next;
        }
        return NULL;
    }
};