198.js

/** ------------------------------------------------------------------------------
 * 
 * 198. House Robber
 * Topics: Dynamic Programming
 * https://leetcode.com/problems/house-robber/description/
 * 
 ------------------------------------------------------------------------------ */
/**
 * @param {number[]} nums
 * @return {number}
 */
var rob = function (nums) {
  const dp = new Array(nums.length)
  dp[0] = nums[0]
  dp[1] = Math.max(nums[0], nums[1])

  for (let i = 2; i < nums.length; i++) {
    dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1])
  }

  return dp[nums.length - 1]
}

console.log(rob([1, 2, 3, 1]))