62. 不同路径 题目描述 解题思路: dp,画表,找出递推关系式 if j == 0 && i == 0 -> a[i][j] = 0 else if j == 0 || i == 0 -> a[i][j] = 1 else a[i][j] = a[i-1][j] + a[i][j-1]T4mako8/18/23Less than 1 minute算法数学动态规划组合数学