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

面试题 12[矩阵中的路径] 的时间复杂度和空间复杂度是多撒？ #67

Open

freezen opened this issue Oct 19, 2019 · 0 comments

freezen commented Oct 19, 2019

assume 矩阵m*n, str 长度为 k

那么：
时间复杂度是？mn+4^k ?
空间复杂度？k4^k?

有人会吗？

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