LeetCode-Intersection of Two Linked Lists finds the Intersection position of Two Linked Lists, so that the long Linked list goes first.

Source: Internet
Author: User

LeetCode-Intersection of Two Linked Lists finds the Intersection position of Two Linked Lists, so that the long Linked list goes first.

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 shocould preferably run in O (n) time and use only O (1) memory. it can only be the time complexity of O (n). The method here is to traverse two linked lists to know the length, then let the long linked list go first, and then compare them by two, time complexity O (lengthA + lengthB + maxLength) is O (n)

```/*** 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 lengthA = 1; int lengthB = 1; ListNode * Afirst = headA; ListNode * Bfirst = headB; while (Afirst-> next) {lengthA ++; First = Afirst-> next;} while (Bfirst-> next) {lengthB ++; Bfirst = Bfirst-> next;} if (Afirst! = Bfirst) {return NULL;} int length = lengthA ;//
<随便初始化一个 if(lengtha>

```

Related Keywords:

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• Sales Support

1 on 1 presale consultation

• After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.