偷金问题

一排n个房子,每个房子都有未知的金子,不能连续偷3个房子的金子,怎么才能偷到最多的金子

public class Demo {
    private static int stole(int[] array) {
        int[][] dp = new int[3][array.length + 1];
        for (int i = 0; i < dp.length; i++) {
            for (int j = 0; j < dp[0].length; j++) {
                dp[i][j] = -1;
            }
        }
        calculate(array, dp, 0, array.length);
        return dp[0][array.length];
    }

    private static int calculate(int[] array, int[][] dp, int front, int remaining) {
        if (remaining == 0) return 0;
        if (dp[front][remaining] != -1) return dp[front][remaining];

        int left = -1;
        if (front < 2) {
            left = array[array.length - remaining] + calculate(array, dp, front + 1, remaining - 1);
        }
        int right = calculate(array, dp, 0, remaining - 1);
        dp[front][remaining] = Math.max(left, right);
        return dp[front][remaining];
    }

    public static void main(String[] args) {
        int[] arr = {1, 3, 5, 5, 10};
        System.out.println(stole(arr));
    }
}