LeetCode 62. Unique Paths

描述

求从左上角走到右下角，共有多少种走法

解决

动态规划

---

class Solution {public:    int uniquePaths(int m, int n) {        int arr[m][n] = {0};        for (int i = 0; i < n; ++i)            arr[0][i] = 1;        for (int j = 0; j < m; ++j)            arr[j][0] = 1;        for (int i = 1; i < m; ++i)        {            for (int j = 1; j < n; ++j)            {                arr[i][j] = arr[i - 1][j] + arr[i][j - 1];            }        }        return arr[m - 1][n - 1];    }};