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_2 = - 1 ;
    int var_3 = - 1 ;
    for ( int var_4 = 0 ;
    var_4 < var_1 . length ;
    var_4 ++ ) {
      if ( var_1 [ var_4 ] % 2 == 1 ) {
        var_2 = var_4 ;
      }
      else {
        if ( var_3 == - 1 ) {
          var_3 = var_4 ;
        }
      }
      if ( var_2 > var_3 && var_3 != - 1 ) {
        int var_5 = var_1 [ var_2 ] ;
        var_1 [ var_2 ] = var_1 [ var_3 ] ;
        var_1 [ var_3 ] = var_5 ;
        var_4 = var_3 - 1 ;
        var_3 = - 1 ;
      }
    }
  }
  