Leetcode: Unique Paths

 To make some practice on DP, "Unique Paths"@Leetcode is solved.

Probably a typical one, and super easy.
https://leetcode.com/problems/unique-paths

import numpy as np

class Solution:

def uniquePaths(self, m: int, n: int) -> int:

dp = np.zeros((m,n),np.int32)

dp[0,:]=1

dp[:,0]=1

for j in range(1,m):

for i in range(1,n):

dp[j,i] = dp[j-1,i] + dp[j,i-1]

return dp[m-1][n-1]