Skip to content
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.

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

最大连续子序列和处的笔误 #4

Open
zhengyhn opened this issue Nov 1, 2018 · 4 comments
Open

最大连续子序列和处的笔误 #4

zhengyhn opened this issue Nov 1, 2018 · 4 comments

Comments

@zhengyhn
Copy link

zhengyhn commented Nov 1, 2018

$$ f(n,n) $$即为序列$$ s_1 $$和$$ s_2 $$的最长公共子序列的长度值。该算法的时间复杂度为$$ O(n^2) $$。

最后一句话,应该是从最长公共子序列里面复制过来的。

另外,赞一个,写得非常好,我推荐给团队的人学习。

@linrongbin16
Copy link
Owner

linrongbin16 commented Nov 1, 2018

这个地方确实写错了,感谢指出,我会尽快修复。

感谢关注,如果喜欢的话请帮我多宣传宣传哈!您的关注是我工作的动力。

@linrongbin16
Copy link
Owner

@zhengyhn
Copy link
Author

zhengyhn commented Nov 4, 2018

@linrongbin16 , 该算法的时间复杂度为O(n2)。这里应该是O(n)吧?难道我理解错了?

@linrongbin16 linrongbin16 reopened this Nov 4, 2018
@linrongbin16
Copy link
Owner

linrongbin16 commented Nov 4, 2018

现在细看一下,这个算法写的好像确实有点迷,公式好像也是错的。

我回家再仔细看看,先留着问题。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants