public int rob_standardDP(int[] nums) {
        if (nums.length == 0)
            return 0;
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        for (int i = 0; i < nums.length; ++i) {
            int max = 0;
            for (int j = 0; j < i - 1; ++j) {
                max = Math.max(dp[j], max);
            }
            dp[i] = max + nums[i];
        }
        int max = 0;
        for (int i : dp) {
            max = Math.max(max, i);
        }
        return max;
    }