const (
	Steal = iota
	Jump
)

func rob(nums []int) int {
	if len(nums) == 0 {
		return 0
	}
	if len(nums) == 1 {
		return nums[0]
	}
	
	return max(robOne(nums[1:]), robOne(nums[:len(nums)-1]))
}

func robOne(nums []int) int {
	homeCount := len(nums)
	dp := make([][]int, homeCount+1) // [homeIdx][steal or jump] => max value
	for i := 0; i <= homeCount; i++ {
		dp[i] = make([]int, 2)
	}

	for i := 1; i <= homeCount; i++ {
		currentValue := nums[i-1]
		dp[i][Steal] = dp[i-1][Jump] + currentValue
		dp[i][Jump] = max(dp[i-1][Jump], dp[i-1][Steal])
	}
	return max(dp[homeCount][Steal], dp[homeCount][Jump])
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}