House Robber LeetCode solution in Java

1
class Solution {
2
  public int rob(int[] nums) {
3
    int[] t = new int[nums.length];
4
    for (int i = 0; i < t.length; i++) {
5
      t[i] = -1;
6
    }
7
    return helper(nums, 0, t);
8
  }
9

10
  static int helper(int[] nums, int i, int[] t) {
11
    if (i >= nums.length) {
12
      return 0;
13
    }
14
    if (i == nums.length - 1) {
15
      return nums[i];
16
    }
17
    if (t[i] != -1) {
18
      return t[i];
19
    }
20

21
    int pick = nums[i] + helper(nums, i + 2, t);
22
    int unpicked = helper(nums, i + 1, t);
23
    t[i] = Math.max(pick, unpicked);
24
    return t[i];
25
  }
26
}