diff options
author | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /unique_paths.cpp | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'unique_paths.cpp')
-rw-r--r-- | unique_paths.cpp | 22 |
1 files changed, 22 insertions, 0 deletions
diff --git a/unique_paths.cpp b/unique_paths.cpp new file mode 100644 index 0000000..053a92b --- /dev/null +++ b/unique_paths.cpp @@ -0,0 +1,22 @@ +#include "leetcode.h" + +class Solution { +public: + int uniquePaths(int m, int n) { + int dp[m][n]; + for (int i = 0; i < m; i++) { + for (int j = 0; j < n; j++) { + if (i == 0 || j == 0) + dp[i][j] = 1; + else + dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; + } + } + return dp[m - 1][n - 1]; + } +}; + +int main() { + Solution obj; + cout << obj.uniquePaths(3, 7); +} |