题目链接：

 

 

解题思路：

两个链表的公共节点，首先让长的链表先走length1-length2步，然后一起走

1 /** 2  * Definition for singly-linked list. 3  * public class ListNode { 4  *     int val; 5  *     ListNode next; 6  *     ListNode(int x) { 7  *         val = x; 8  *         next = null; 9  *     }10  * }11  */12 public class Solution {13     public ListNode getIntersectionNode(ListNode headA, ListNode headB) {14         15         int lengthA= getlength(headA);16         int lengthB = getlength(headB);17     18         19         if(lengthA>lengthB)20         {21             for(int i=0;i