1. 给n个点(0到n-1)和n-1条有方向的路径,要求最终在0位置集合,需要修改多少条路径的方向 n,l = input().split() n=int(n) l = l.replace('[','') l = l.replace(']','') nums = [int(i) for i in l.split(',')] linjiebiao = [[] for i in range(n)] paths&nbs...