注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
step = 15
def __init__(self, n, A):
A = dict(enumerate(A))
jump = [A]
for s in xrange(self.step):
B = {}
for i in A:
if A[i] in A:
B[i] = A[A[i]]
jump.append(B)
A = B
self.jump = jump
def getKthAncestor(self, x, k):
step = self.step
while k > 0 and x > -1:
if k >= 1 << step:
x = self.jump[step].get(x, -1)
k -= 1 << step
else:
step -= 1
return x
step = 15又是在说什么?我整个过程被self弄懵了。。。。。。。。
|