House Robber LeetCode solution in JavaScript

1
const max = (x, y) => (x > y ? x : y);
2
var rob = function (nums) {
3
  if (nums.length == 1) return nums[0];
4
  let temp = [];
5
  temp[0] = nums[0];
6
  temp[1] = max(nums[0], nums[1]);
7

8
  for (let i = 2; i < nums.length; i++) {
9
    temp[i] = max(temp[i - 1], nums[i] + temp[i - 2]);
10
  }
11
  // console.log(temp)
12
  return temp[nums.length - 1];
13
};