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

更新 0053 最大子序和 JavaScript 解法 #773

Merged
merged 1 commit into from
Sep 24, 2021

Conversation

Jerry-306
Copy link
Contributor

既然已经知道dp数组长度,初始化时就应该创建一个固定长度的数组,而不是直接用 [nums[0]] 代替,这样会影响性能

既然已经知道dp数组长度,初始化时就应该创建一个固定长度的数组,而不是直接用 [nums[0]] 代替,这样会影响性能
@youngyangyang04 youngyangyang04 merged commit 7081a0f into youngyangyang04:master Sep 24, 2021
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

Successfully merging this pull request may close these issues.

2 participants