do max robbing with DP

0198_house-robber.cs

// O(N), O(N)
public class Solution {
  public int Rob(int[] nums) {
    var dp = new int[nums.Length];
    
    for (int i=0; i<nums.Length; i++)
      dp[i] = Math.Max((i < 2? 0 : dp[i-2]) + nums[i], i<1? 0 : dp[i-1]);

    return nums.Length == 0 ? 0 : dp[nums.Length-1];
  }
}