leetcode解题方案--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.
Credits:
Special thanks to @stellari for adding this problem and creating all test cases.

分析

先遍历两个链表，得到两个长度。
然后长链表步进 找到共同元素

public class Solution {
    public static ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        int lengtha = 0;
        int lengthb = 0;
        ListNode nodeA = headA;
        while (nodeA!=null) {
            lengtha++;
            nodeA = nodeA.next;
        }
        ListNode nodeB = headB;
        while (nodeB !=null) {
            lengthb++;
            nodeB = nodeB.next;
        }
        int diff = lengtha - lengthb;
        nodeA = headA;
        nodeB = headB;
        if (diff>0) {
            while (diff-->0) {
                nodeA = nodeA.next;
            }
        } else {
            diff = 0- diff;
            while (diff-->0) {
                nodeB = nodeB.next;
            }
        }
        while (nodeA!=null && nodeB!=null) {
            if (nodeA == nodeB) {
                return nodeA;
            } else {
                nodeA = nodeA.next;
                nodeB = nodeB.next;
            }
        }
        return null;




    }
}