leetcode160

/**
 * 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<ListNode>();
                var listB = new List<ListNode>();
                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 = ; i < listB.Count; i++)
                    {
                        if (listA[i].val != listB[i].val)
                        {
                            if (i > )
                            {
                                tempB = listB[i - ];
                            }
                            else
                            {
                                tempB = null;
                            }
                            break;
                        }
                        else
                        {
                            if (i > )
                            {
                                tempB = listB[i];
                            }
                        }
                    }
                    return tempB;
                }
                else
                {
                    for (int i = ; i < listA.Count; i++)
                    {
                        if (listA[i].val != listB[i].val)
                        {
                            if (i > )
                            {
                                tempA = listA[i - ];
                            }
                            else
                            {
                                tempA = null;
                            }
                            break;
                        }
                        else
                        {
                            if (i > )
                            {
                                tempA = listA[i];
                            }
                        }
                    }
                    return tempA;
                }
            }
        }
}

https://leetcode.com/problems/intersection-of-two-linked-lists/#/description

补充一个python的实现：

 class Solution(object):
     def getIntersectionNode(self, headA, headB):
         """
         :type head1, head1: ListNode
         :rtype: ListNode
         """
         tempA = headA
         tempB = headB
         while tempA != tempB:
             if tempA == None:
                 tempA = headB
             else:
                 tempA = tempA.next
             if tempB == None:
                 tempB = headA
             else:
                 tempB = tempB.next
         return tempA