diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/unique_paths.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/unique_paths.cpp')
-rw-r--r-- | other/unique_paths.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/unique_paths.cpp b/other/unique_paths.cpp deleted file mode 100644 index 053a92b..0000000 --- a/other/unique_paths.cpp +++ /dev/null @@ -1,22 +0,0 @@ -#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); -} |