house_robber.go

// You are a professional robber planning to rob houses along a street.
// Each house has a certain amount of money stashed,
// the only constraint stopping you from robbing each of them is that
// adjacent houses have security system connected and// it will automatically contact the police if
// two adjacent houses were broken into on the same night.
// Given a list of non-negative integers representing the amount of money of each house,
// determine the maximum amount of money you can rob tonight without alerting the police.
// read more defail from https://leetcode.com/problems/house-robber/description/

package rob

// Rob calculate the max amount of money
func Rob(nums []int) int {
	var sum_1, sum_2 int
	for k, v := range nums {
		if k%2 == 0 {
			sum_1 += v
		} else {
			sum_2 += v
		}
	}

	if sum_1 > sum_2 {
		return sum_1
	}
	return sum_2
}