house-robber.go

package leetcode_solutions_golang

import "math"

//https://leetcode.com/problems/house-robber/
func rob(nums []int) int {
	if len(nums) == 1 {
		return nums[0]
	}
	dp := [100]int{}
	dp[0] = nums[0]
	dp[1] = int(math.Max(float64(nums[0]), float64(nums[1])))
	for i := 2; i < len(nums); i++ {
		dp[i] = int(math.Max(float64(dp[i-1]), float64(dp[i-2]+nums[i])))
	}
	return dp[len(nums)-1]
}