leetcode-198 打家劫舍

/**
 * @param {number[]} nums
 * @return {number}
 */
var rob = function (nums) {
  let oddSum = 0,
    evenSum = 0;
  for (let i = 0; i < nums.length; i++) {
    if (i % 2 === 0) {
      evenSum += nums[i];
    } else {
      oddSum += nums[i];
    }
  }
  return Math.max(oddSum, evenSum);
};

/**
 * @param {number[]} nums
 * @return {number}
 */
var rob = function (nums) {
  //
  if (nums.length === 1) return nums[0];
  else if (nums.length === 2) return Math.max(nums[0], nums[1]);
  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 - 1], dp[i - 2] + nums[i]);
  }
  return dp[nums.length - 1];
};

/**
 * @param {number[]} nums
 * @return {number}
 */
var rob = function (nums) {
  let cur = 0,
    prev = 0;
  for (const num of nums) {
    const temp = Math.max(cur, prev + num);
    prev = cur;
    cur = temp;
  }
  return cur;
};
// console.log("🚀 ~ rob([1, 2, 3, 1]):", rob([1, 2, 3, 1]));