160. 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.

思路：

在做这道题之前刚刚在《剑指offer》上看到了这个题目。。。

找到两个链表的交汇节点，从该节点之后两个链表的所有节点都相同，然而这是一个单向链表，无法在时间复杂度较小的情况下从后向前遍历。

因此，转化思路，先计算两个链表上的节点数，然后再让较长的指针先走几步，保证在长指针先走之后，两个链表的剩余长度相同。

这样当找到一个节点，从它之后的两个链表的所有节点都相同（包括该节点），那么它就是要寻找的节点。

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        //处理特殊情况
        if(headA == null || headB == null){return null;}
        //分别计算两个链表的长度
        ListNode pShort = headA, pLong = headB;
        int lenShort = 0, lenLong = 0;
        while(pShort != null){
            lenShort++;
            pShort = pShort.next;
        }
        while(pLong != null){
            lenLong++;
            pLong = pLong.next;
        }
        pShort = headA;
        pLong = headB;
        if(lenShort > lenLong){
            pShort = headB;
            pLong = headA;
            int t = lenShort;
            lenShort = lenLong;
            lenLong = t;
        }
        //将长度较长的链表向后移动几个位置以保障两个链表剩下的节点数相同
        int count = 0;
        while(count < (lenLong-lenShort)){
            pLong = pLong.next;
            count++;
        }
        //寻找两个长度相同链表的交汇节点
        ListNode intersection = null;
        while(pShort != null){
            if(pShort.val == pLong.val && intersection == null){intersection = pShort;}
            if(pShort.val != pLong.val && intersection != null){intersection = null;}
            pShort = pShort.next;
            pLong = pLong.next;
        }
        return intersection;
    }
}