leetcode 815

class Solution(object):
    def numBusesToDestination(self, routes, source, target):
        """
        :type routes: List[List[int]]
        :type source: int
        :type target: int
        :rtype: int
        """
        if source==target:
            return 0
        for r in routes:
            if  source in r and target in r:
                return  1
        source_index = []
        target_index = []
        for j in routes[:]:
            if source in j:
                source_index.append(j)
                routes.remove(j)
            if target in j:
                target_index.append(j)
                routes.remove(j)
        n=2
        num=get_intersection(routes,source_index,target_index,n)
        return num

def get_intersection(routes,source,target,n):
    #如果有交集
    source_=[]
    for s in source:
        for t in target:
            if len(list(set(s).intersection(set(t)))):
                return n
                break
    for s in source:
        for val in routes[:]:
            if len(list(set(s).intersection(set(val)))):
                    routes.remove(val)
                    source_.append(val)
    n+=1
    if (len(source_)==0 & len(routes)==0):
        return -1
    return get_intersection(routes, source_, target, n)