Commit 4c3553b

zhangzz2015gitbook-bot

authored and

committed

1 parent 2dd1588 commit 4c3553bCopy full SHA for 4c3553b

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -310,6 +310,31 @@ func climbStairs(n int) int {`
`310`	`310`	`}`
`311`	`311`	```
`312`	`312`
	`313`	`+### [House Robber](https://leetcode.com/problems/house-robber/)`
	`314`	`+`
	`315`	+```cpp
	`316`	`+// Some code`
	`317`	`+class Solution {`
	`318`	`+public:`
	`319`	`+ int rob(vector<int>& nums) {`
	`320`	`+`
	`321`	`+ // dp[i] = max(nums[i] + dp[i-2], dp[i-1]);`
	`322`	`+ int prevPrev =0;`
	`323`	`+ int prev = 0;`
	`324`	`+ for(int i=0; i< nums.size(); i++)`
	`325`	`+ {`
	`326`	`+ int current = max(nums[i] + prevPrev, prev);`
	`327`	`+`
	`328`	`+ prevPrev = prev;`
	`329`	`+ prev = current;`
	`330`	`+ }`
	`331`	`+`
	`332`	`+ return prev;`
	`333`	`+`
	`334`	`+ }`
	`335`	`+};`
	`336`	+```
	`337`	`+`
`313`	`338`	`### [jump-game](https://leetcode-cn.com/problems/jump-game/)`
`314`	`339`
`315`	`340`	`> 给定一个非负整数数组,你最初位于数组的第一个位置。数组中的每个元素代表你在该位置可以跳跃的最大长度。判断你是否能够到达最后一个位置。`

Comments

(0)