# Leetcode 160 Intersection of Two Linked Lists.

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

1, Get the length of the two lists.

2, Align them to the same start point.

3, Move them together until finding the intersection point, or the end null

```
/**
* 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) {
int listonelen=length(headA);
int listtwolen=length(headB);
while(listonelen
```listtwolen){
headA=headA.next;
listonelen--;
}
while(headA!=headB){
headA=headA.next;
headB=headB.next;
}
return headA;
}
public int length(ListNode listnode){
int len=0;
while(listnode!=null){
len=len+1;
listnode=listnode.next;
}
return len;
}
}