房屋抢劫问题

198. House Robber

题目链接
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
             Total amount you can rob = 1 + 3 = 4.

Example 2:

Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
             Total amount you can rob = 2 + 9 + 1 = 12.

题目大意
有一个强盗打算抢劫一条街的房子， 但是他不能连续抢劫相连的两栋房屋，否则会触发警报。现在用一个整数数组表示每栋房屋中的现金，找出这个强盗在不触发警报的情况下能抢到最多的钱。

解题思路
状态

• 抢劫当前房屋:rob or dp[i][1]
• 不抢劫当前房屋: notRob or dp[i][0]

选择

• 选择两个状态中的最大值

转移方程

• 不抢劫：dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1]);
  抢劫： dp[i][1] = num[i - 1] + dp[i - 1][0];

  不抢劫: notRob = Math.max(notRob, rob);
  抢劫: rob = Math.max(rob, pre + nums[i]);
  复杂度
  SC: O(1)
  TC: O(n)

public int rob(int[] nums) {
   
   int rob = 0;
    int notRob = 0;
    
    for (int i = 0; i < nums.length; i++){
   
        int pre = notRob;
        notRob = Math.</