House Robber LeetCode solution in C++

1
class Solution {
2
 public:
3
  int helper(int i, vector<int> &nums) {
4
    if (i == 0) return nums[i];
5
    if (i < 0) return 0;
6

7
    int pick = nums[i] + helper(i - 2, nums);
8
    int not_pick = 0 + helper(i - 1, nums);
9

10
    return max(pick, not_pick);
11
  }
12
  int rob(vector<int> &nums) {
13
    return helper(nums.size() - 1, nums);
14
  }
15
};