Saved from https://leetcode-cn.com/problems/house-robber/submissions/

rob.go

func max(x, y int) int {
    if x > y {
        return x
    }
    return y
}

func rob(nums []int) int {
    if len(nums) == 0 {
        return 0
    }
    if len(nums) == 1 {
        return nums[0]
    }
    if len(nums) == 2 {
        return max(nums[0], nums[1])
    }
    a, b := nums[0], max(nums[0], nums[1])
    for i := 2; i < len(nums); i++ {
        a, b = b, max(a + nums[i], b)
    }
    return b
}