comefrom: <awangdev>Interleaving Positive and Negative Numbers_3.java
code: public void rerange(int[] A) {
  	   	if (A == null || A.length == 0) {
  	   		return;
  	   	}
  	   	Arrays.sort(A);
  	   	int count = 0;
  	   	for (int num : A){
  	   		count += num >= 0 ? 1 : -1;
  	   	}
  	   	int start = 0;
  	   	int end = A.length - 1;
  	   	if (count < 0) {
  	   		start++;
  	   	} else if (count > 0){
  	   		end--;
  	   	}
  	   	
  	   	while (start < end) {
  	   		if (A[start] < 0 && A[end] >= 0) {
  	   			int temp = A[start];
  	   			A[start] = A[end];
  	   			A[end] = temp;
  	   		}
  	   		start += 2;
  	   		end -= 2;
  	   	}
     	}
masked: public void var_0 ( int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return ;
    }
    Arrays . sort ( var_1 ) ;
    int var_7 = 0 ;
    for ( int var_8 : var_1 ) {
      var_7 += var_8 >= 0 ? 1 : - 1 ;
    }
    int var_10 = 0 ;
    int var_11 = var_1 . length - 1 ;
    if ( var_7 < 0 ) {
      var_10 ++ ;
    }
    else if ( var_7 > 0 ) {
      var_11 -- ;
    }
    while ( var_10 < var_11 ) {
      if ( var_1 [ var_10 ] < 0 && var_1 [ var_11 ] >= 0 ) {
        int var_12 = var_1 [ var_10 ] ;
        var_1 [ var_10 ] = var_1 [ var_11 ] ;
        var_1 [ var_11 ] = var_12 ;
      }
      var_10 += 2 ;
      var_11 -= 2 ;
    }
  }
  