comefrom: <awangdev>Partition Array by Odd and Even_1.java
code: public void partitionArray(int[] nums) {
      	if (nums == null || nums.length == 0){
      		return;
      	}
      	int nextOddPt = -1;
      	int firstEvenPt = -1;
      	for (int i = 0; i < nums.length; i++) {
      		if (nums[i] % 2 == 1) {
      			nextOddPt = i;
      		} else {
      			if (firstEvenPt == -1) {
      				firstEvenPt = i;
      			}
      		}
      		if (nextOddPt > firstEvenPt && firstEvenPt != -1) {
      			int temp = nums[nextOddPt];
      			nums[nextOddPt] = nums[firstEvenPt];
      			nums[firstEvenPt] = temp;
      			i = firstEvenPt - 1;
      			firstEvenPt = -1;
      		}
      	}
      }
masked: public void var_0 ( int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return ;
    }
    int var_6 = - 1 ;
    int var_7 = - 1 ;
    for ( int var_8 = 0 ;
    var_8 < var_1 . length ;
    var_8 ++ ) {
      if ( var_1 [ var_8 ] % 2 == 1 ) {
        var_6 = var_8 ;
      }
      else {
        if ( var_7 == - 1 ) {
          var_7 = var_8 ;
        }
      }
      if ( var_6 > var_7 && var_7 != - 1 ) {
        int var_10 = var_1 [ var_6 ] ;
        var_1 [ var_6 ] = var_1 [ var_7 ] ;
        var_1 [ var_7 ] = var_10 ;
        var_8 = var_7 - 1 ;
        var_7 = - 1 ;
      }
    }
  }
  