<awangdev>561. Array Partition I_1.java
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;
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length <= 1 ) {
    return 0 ;
  }
  Arrays . sort ( var_0 ) ;
  long var_7 = 0 ;
  for ( int var_8 = 0 ;
  var_8 < var_0 . length ;
  var_8 ++ ) {
    var_7 += var_8 % 2 == 0 ? var_0 [ var_8 ] : 0 ;
  }
  return ( int ) var_7 ;
}
