99클럽 코테 스터디 40일차 TIL + 오늘의 학습 키워드

☑️ Leetcode:  62. Unique Paths

https://leetcode.com/problems/unique-paths/description/

 

 

☑️ Code (DP)

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];

        // 1. init the base cases
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }

        // 2. fill the DP table
        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];
    }
}