comefrom: <awangdev>561. Array Partition I_1.java
code: public int arrayPairSum(int[] nums) {
          if (nums == null || nums.length <= 1) {
              return 0;
          }
          Arrays.sort(nums);
          long result = 0;
          for (int i = 0; i < nums.length; i++) {
              result += i % 2 == 0 ? nums[i] : 0;
          }
          return (int)result;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length <= 1 ) {
      return 0 ;
    }
    Arrays . sort ( var_0 ) ;
    long var_1 = 0 ;
    for ( int var_2 = 0 ;
    var_2 < var_0 . length ;
    var_2 ++ ) {
      var_1 += var_2 % 2 == 0 ? var_0 [ var_2 ] : 0 ;
    }
    return ( int ) var_1 ;
  }
  