We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
LeetCode 第5题 5. 最长回文子串 Python3 版的解法原样提交后提示 Time Limit Exceeded
The text was updated successfully, but these errors were encountered:
没超时呢,我试了。数据规模 $10^3$,算法时间复杂度 $O(n^2)$,可以通过
Sorry, something went wrong.
英文站点应该是新增了测试用例了,导致代码无法通过
没错,英文站点超时了
22c2071
新增了空间复杂度 $O(1)$ 的解法,这个解法不会超时了。
No branches or pull requests
LeetCode 第5题 5. 最长回文子串 Python3 版的解法原样提交后提示 Time Limit Exceeded
The text was updated successfully, but these errors were encountered: