diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/unique_paths.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
Diffstat (limited to 'other/unique_paths.cpp')
-rw-r--r-- | other/unique_paths.cpp | 22 |
1 files changed, 22 insertions, 0 deletions
diff --git a/other/unique_paths.cpp b/other/unique_paths.cpp new file mode 100644 index 0000000..053a92b --- /dev/null +++ b/other/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); +} |