leetcode 160 Intersection of Two Linked Lists（难易度：Easy）

Intersection of Two Linked Lists

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;
 *     struct ListNode *next;
 * };
 */
struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB) {
    unsigned int lengthA = 0;
    unsigned int lengthB = 0;
    unsigned int lengthDif;
    struct ListNode *LONG = headA;
    struct ListNode *SHORT = headB;
    while(LONG != NULL)
    {
        ++ lengthA;
        LONG = LONG->next;
    }
    while(SHORT != NULL)
    {
        ++ lengthB;
        SHORT = SHORT->next;
    }
    if(lengthA >lengthB)
    {
        lengthDif = lengthA - lengthB;
        LONG = headA;
        SHORT = headB;
    }
    else
    {
        lengthDif = lengthB - lengthA;
        LONG = headB;
        SHORT = headA;
    }
    while(lengthDif)
    {
        LONG = LONG->next;
        lengthDif --;
    }
    while ((LONG != NULL) && (SHORT != NULL) && (LONG != SHORT))
    {
        LONG = LONG->next;
        SHORT = SHORT->next;
    }
    return LONG;
}

原题地址： https://leetcode.com/problems/intersection-of-two-linked-lists/