New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

动态规划第7题（Leetcode 63 不同路径 II） #174

Open

jun1015 opened this issue May 18, 2021 · 1 comment

jun1015 commented May 18, 2021

动态规划的空间代价应该是可以优化至O(n)的，因为障碍物矩阵没有修改，只修改了dp数组

Owner

youngyangyang04 commented Jun 12, 2021

动态规划的空间代价应该是可以优化至O(n)的，因为障碍物矩阵没有修改，只修改了dp数组

是可以的👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment