classSolution(object):defnumWays(self, n, relation, k):
dp =[[0]*n for i inrange(k+1)]
dp[0][0]=1for i inrange(1,k+1):for r in relation:
dp[i][r[1]]+= dp[i-1][r[0]]return dp[-1][-1]
LCP 07. 传递信息dp[i][j]表示第i次传递时j号同学收到消息的方案数,因为都是从0开始到n-1结束,所以dp[-1][-1]就是到n-1号的方案数class Solution(object): def numWays(self, n, relation, k): dp = [[0]*n for i in range(k+1)] dp[0][0] = 1 for i in range(1,k+1): for r