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.

public static int rob2(int[] nums, int begin,int sum) {
        if (begin >= nums.length) {
        
            return sum;
        }
        int sum1=rob2(nums, begin + 2,sum+nums[begin]);
        int sum2=rob2(nums, begin + 1,sum);
        return Math.max(sum1, sum2);
        
    }

這里一定要注意返回的意義要一樣，并且選和不選是其實可以參考成一顆二叉樹