Skip to content

Update 70. Climbing Stairs.md#1

Open
simidagogogo wants to merge 1 commit intoguest-li:masterfrom
simidagogogo:patch-2
Open

Update 70. Climbing Stairs.md#1
simidagogogo wants to merge 1 commit intoguest-li:masterfrom
simidagogogo:patch-2

Conversation

@simidagogogo
Copy link
Copy Markdown

@simidagogogo simidagogogo commented Aug 11, 2020

  1. 数组可以直接开到int[] res = new int[n + 3];此外,不需要通过res[n-1]的方式访问第n个元素,直接res[n]即可。
  2. 开辟长度为n的数组存储中间结果不是最优的。空间复杂度可进一步优化为O(1)
  3. md的代码格式,可以在代码段的开头和结尾加上```

1. 数组可以直接开到`int[] res = new int[n + 3];`然后就不需要用过`res[n-1]`的方式访问第`n`个元素了,直接`res[n]`即可。
2. 另外,开辟长度为n的数组存储中间结果不是最优的。空间复杂度可进一步优化。
3. md的代码格式,可以在代码段的开头和结尾加上```
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.

1 participant