comefrom: <awangdev>53. Maximum Subarray_6.java
code: public int maxSubArray(int[] nums) {
          if (nums == null || nums.length == 0) return 0;
          int n = nums.length, max = Integer.MIN_VALUE;
          int[] dp = new int[2];
          dp[0] = 0;
  
          for (int i = 1; i <= n; i++) {
              dp[i % 2] = nums[i - 1] + (dp[(i - 1) % 2] >= 0 ? dp[(i - 1) % 2] : 0);
              max = Math.max(max, dp[i % 2]);
          }
          return max;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) return 0 ;
    int var_1 = var_0 . length , max = Integer . MIN_VALUE ;
    int [ ] var_2 = new int [ 2 ] ;
    var_2 [ 0 ] = 0 ;
    for ( int var_3 = 1 ;
    var_3 <= var_1 ;
    var_3 ++ ) {
      var_2 [ var_3 % 2 ] = var_0 [ var_3 - 1 ] + ( var_2 [ ( var_3 - 1 ) % 2 ] >= 0 ? var_2 [ ( var_3 - 1 ) % 2 ] : 0 ) ;
      max = Math . max ( max , var_2 [ var_3 % 2 ] ) ;
    }
    return max ;
  }
  