LeetCodeOJ_160_Intersection of Two Linked Lists

最新推荐文章于 2015-12-08 17:45:49 发布

小云子93

最新推荐文章于 2015-12-08 17:45:49 发布

阅读量309

点赞数

分类专栏： LeetCodeOJ 文章标签： OJ 算法 c++

本文链接：https://blog.csdn.net/u012482487/article/details/46984421

版权

LeetCodeOJ 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

答题链接

题目:

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.

分析：

从交叉点开始，到链表末尾，两个链表的长度是一样的。

代码：

/**
 * 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) {
        ListNode *intersection=NULL;
        if(headA==NULL||headB==NULL)
            return intersection;

        //统计链表A的长度
        ListNode * curNodeA=NULL;
        int lenA=0;
        curNodeA=headA;
        while(curNodeA!=NULL)
        {
            curNodeA=curNodeA->next;
            lenA++;
        }
        //统计链表B的长度
        ListNode * curNodeB=NULL;
        int lenB=0;
        curNodeB=headB;
        while(curNodeB!=NULL)
        {
            curNodeB=curNodeB->next;
            lenB++;
        }
        //定位起始比较点
        curNodeA=headA;
        curNodeB=headB;
        if(lenA>lenB)
        {
            for(int i=0;i<(lenA-lenB);i++)
            {
                curNodeA=curNodeA->next;
            }
        }
        else if(lenA<lenB)
        {
            for(int i=0;i<(lenB-lenA);i++)
            {
                curNodeB=curNodeB->next;
            }
        }
        //寻找交叉点
        while(curNodeA->val!=curNodeB->val||curNodeA->next!=curNodeB->next)
           {
               curNodeA=curNodeA->next;
               curNodeB=curNodeB->next;
               if(curNodeA==NULL)
                  break;
           }
           intersection=curNodeA;

        return intersection;

    }
};