lc-go/solutions/1/q198/solution.go

14 lines
308 B
Go

// Package q198 implements a solution for https://leetcode.com/problems/house-robber/
package q198
func rob(nums []int) int {
if len(nums) > 1 {
nums[1] = max(nums[0], nums[1])
}
for i := 2; i < len(nums); i++ {
nums[i] = max(nums[i-2]+nums[i], nums[i-1])
}
return nums[len(nums)-1]
}
var _ = rob