comefrom: <awangdev>198. House Robber_2.java
code: public int rob(int[] nums) {
          if (nums == null || nums.length == 0) return 0;
          int n = nums.length;
          long[] dp = new long[2];
          dp[0] = 0; 
          dp[1] = nums[0];
          for (int i = 2; i <= n; i++) {
              dp[i % 2] = Math.max(dp[(i - 1)%2], dp[(i - 2)%2] + nums[i - 1]);
          }
          return (int) dp[n % 2];
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) return 0 ;
    int var_1 = var_0 . length ;
    long [ ] var_2 = new long [ 2 ] ;
    var_2 [ 0 ] = 0 ;
    var_2 [ 1 ] = var_0 [ 0 ] ;
    for ( int var_3 = 2 ;
    var_3 <= var_1 ;
    var_3 ++ ) {
      var_2 [ var_3 % 2 ] = Math . max ( var_2 [ ( var_3 - 1 ) % 2 ] , var_2 [ ( var_3 - 2 ) % 2 ] + var_0 [ var_3 - 1 ] ) ;
    }
    return ( int ) var_2 [ var_1 % 2 ] ;
  }
  