<qiyuangong>905_Sort_Array_By_Parity_2.java
public int[] sortArrayByParity(int[] A) {
        int lo = 0, hi = A.length - 1;
        while (lo < hi) {
            if (A[lo] % 2 > A[hi] % 2) {
                int tmp = A[hi];
                A[hi] = A[lo];
                A[lo] = tmp;
            }
            if (A[lo] % 2 == 0) lo++;
            if (A[hi] % 2 == 1) hi--;
        }
        return A;
    }
public int [ ] sample_funcname ( int [ ] var_0 ) {
  int var_2 = 0 , var_5 = var_0 . length - 1 ;
  while ( var_2 < var_5 ) {
    if ( var_0 [ var_2 ] % 2 > var_0 [ var_5 ] % 2 ) {
      int var_7 = var_0 [ var_5 ] ;
      var_0 [ var_5 ] = var_0 [ var_2 ] ;
      var_0 [ var_2 ] = var_7 ;
    }
    if ( var_0 [ var_2 ] % 2 == 0 ) var_2 ++ ;
    if ( var_0 [ var_5 ] % 2 == 1 ) var_5 -- ;
  }
  return var_0 ;
}
