comefrom: <gouthampradhan>dynamic_programming_MaximumSubarray_1.java
code: public int maxSubArray(int[] nums) {
      if (nums.length == 1) return nums[0];
      int max = nums[nums.length - 1];
      for (int i = nums.length - 2; i >= 0; i--) {
        nums[i] = Math.max(nums[i], nums[i] + nums[i + 1]);
        max = Math.max(max, nums[i]);
      }
      return max;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
    int max = var_0 [ var_0 . length - 1 ] ;
    for ( int var_6 = var_0 . length - 2 ;
    var_6 >= 0 ;
    var_6 -- ) {
      var_0 [ var_6 ] = Math . max ( var_0 [ var_6 ] , var_0 [ var_6 ] + var_0 [ var_6 + 1 ] ) ;
      max = Math . max ( max , var_0 [ var_6 ] ) ;
    }
    return max ;
  }
  