Intersection of Two Linked Lists

每日一题；

今天做的时候有几点以后自己还是需要注意的：

1、输入参数首先需要判断是否为空；需要考虑为空的情况；

2、O(n)是可以遍历可数遍数就好，也就是可以是2n，或者3n什么的；

3、第二件事就是无环链表求节点的时候的思路应该是找到两个链表长度差，让长的先走多少步，然后一起遍历，因为无环，肯定就是Y型的。

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.
 * 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;
        int lA = 0,lB=0,c=0;
        ListNode tempA = headA,tempB=headB;
        ListNode result = null;
        while (tempA!=null){
            lA++;
            tempA = tempA.next;
        }
        while (tempB!=null){
            lB++;
            tempB = tempB.next;
        }
        c = Math.abs(lA-lB);
        if(lA>lB){
            tempA = headA;
            tempB = headB;
        }else {
            tempA = headB;
            tempB = headA;
        }
        while (c>0){
            tempA = tempA.next;
            c--;
        }
        while (tempA.next!=null){
            if(tempA.val == tempB.val && tempA.next.val == tempB.next.val){
                result = tempA;
                break;
            }
            tempA = tempA.next;
            tempB = tempB.next;
        }
        if(tempA.val == tempB.val){
            result = tempA;
        }
        return result;
    }
}