LeeCode62 different path (Java) (dp)

Topic link: LeeCode62 different paths
Topic description:
Because the robot can only go down or to the right, the number of paths at the current position must be equal to the number of paths on the top plus the number of paths on the left, which is converted into a table to
get the code

class Solution {
    
    
    public static int uniquePaths(int m, int n) {
    
    
        int[][] dp=new int[m][n];
        for (int i = 0; i < m; i++) {
    
    
            Arrays.fill(dp[i],1);
        }
        for (int i = 1; i < m; i++) {
    
    
            for (int j = 1; j < n; j++) {
    
    
                dp[i][j]=dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
}