leetCode: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.

/**
 * 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 n1  = headA;
      ListNode n2 = headB;
      while(n1 != null&&n2 != null&&n1 != n2){
          n1=n1.next;
          n2=n2.next;
          if(n1 == n2)
          return n1;
          if(n1 == null)
          n1 = headB;
          if(n2 == null)
          n2 = headA;
      }
      return n1; 
    }
}