/** * Definition for singly-linked list. * public class ListNode { *     public int val; *     public ListNode next; *     public ListNode(int x) { val = x; } * } */public class Solution {    public ListNode GetIntersectionNode(ListNode headA, ListNode headB)        {            if (headA == null || headB == null)            {                return null;            }            else            {                var tempA = headA;                var tempB = headB;                var listA = new List
     
      ();                var listB = new List
      
       ();                while (headA != null)                {                    listA.Add(headA);                    headA = headA.next;                }                while (headB != null)                {                    listB.Add(headB);                    headB = headB.next;                }                listA.Reverse();                listB.Reverse();                if (listA.Count > listB.Count)                {                    for (int i = 0; i < listB.Count; i++)                    {                        if (listA[i].val != listB[i].val)                        {                            if (i > 0)                            {                                tempB = listB[i - 1];                            }                            else                            {                                tempB = null;                            }                            break;                        }                        else                        {                            if (i > 0)                            {                                tempB = listB[i];                            }                        }                    }                    return tempB;                }                else                {                    for (int i = 0; i < listA.Count; i++)                    {                        if (listA[i].val != listB[i].val)                        {                            if (i > 0)                            {                                tempA = listA[i - 1];                            }                            else                            {                                tempA = null;                            }                            break;                        }                        else                        {                            if (i > 0)                            {                                tempA = listA[i];                            }                        }                    }                    return tempA;                }            }        }}
      
     

 

补充一个python的实现：

1 class Solution(object): 2     def getIntersectionNode(self, headA, headB): 3         """ 4         :type head1, head1: ListNode 5         :rtype: ListNode 6         """ 7         tempA = headA 8         tempB = headB 9         while tempA != tempB:10             if tempA == None:11                 tempA = headB12             else:13                 tempA = tempA.next14             if tempB == None:15                 tempB = headA16             else:17                 tempB = tempB.next18         return tempA