algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 20:40:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 0053 最大子序和 JavaScript 解法

Browse Source 
既然已经知道dp数组长度，初始化时就应该创建一个固定长度的数组，而不是直接用 [nums[0]] 代替，这样会影响性能
This commit is contained in:
Jerry-306
2021-09-23 08:54:00 +08:00
committed by GitHub
parent 2ca7d0c2e2
commit 270757a277
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0053.最大子序和（动态规划）.md
View File

@ -173,7 +173,8 @@ JavaScript：
```javascript ```javascript
const maxSubArray = nums => { const maxSubArray = nums => {
// 数组长度，dp初始化 // 数组长度，dp初始化
const [len, dp] = [nums.length, [nums[0]]]; const len = nums.length;
let dp = new Array(len).fill(0);
// 最大值初始化为dp[0] // 最大值初始化为dp[0]
let max = dp[0]; let max = dp[0];
for (let i = 1; i < len; i++) { for (let i = 1; i < len; i++) {