mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 12:15:58 +08:00
更新 0053 最大子序和 JavaScript 解法
既然已经知道dp数组长度,初始化时就应该创建一个固定长度的数组,而不是直接用 [nums[0]] 代替,这样会影响性能
This commit is contained in:
@ -173,7 +173,8 @@ JavaScript:
|
||||
```javascript
|
||||
const maxSubArray = nums => {
|
||||
// 数组长度,dp初始化
|
||||
const [len, dp] = [nums.length, [nums[0]]];
|
||||
const len = nums.length;
|
||||
let dp = new Array(len).fill(0);
|
||||
// 最大值初始化为dp[0]
|
||||
let max = dp[0];
|
||||
for (let i = 1; i < len; i++) {
|
||||
|
Reference in New Issue
Block a user