标签: time-complexity
任何人都可以帮我找出并解释下面python函数的时间和空间复杂性吗?
#L is a list of length N def countdist(L, i): if L[i] in L[i+1:]: return L[i+1:].index(L[i]) + 1 else: return 2*N - i + 1