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 in relation: dp[i][r[1]] += dp[i-1][r[0]] return dp[-1][-1]
因篇幅问题不能全部显示，请点此查看更多更全内容