198.打家劫舍.cpp

#include <iostream>
#include <vector>

using namespace std;
/*
 * @lc app=leetcode.cn id=198 lang=cpp
 *
 * [198] 打家劫舍
 */

// @lc code=start
class Solution {
 public:
  /**
   * 状态数组: opt[i] 表示经过第 i 个房子偷到的最大金额
   * dp 方程: dp[i] = max(dp[i-1],dp[i-2] + nums[i])
   * */
  int rob(vector<int>& nums) {
    int pre = 0, cur = 0, tmp = 0;
    for (int i = 0; i < nums.size(); i++) {
      tmp = cur;
      cur = max(pre + nums[i], cur);
      pre = tmp;
    }
    return cur;
  }
};
// @lc code=end