comefrom: <awangdev>26.Remove Duplicates from Sorted Array_2.java
code: public int removeDuplicates(int[] nums) {
          if (nums == null) {
              return 0;
          }
          if (nums.length <= 1) {
              return nums.length;
          }
          int currPos = 0;
          int movingPos = 1;
          while (movingPos < nums.length) {
              while(movingPos < nums.length && nums[currPos] == nums[movingPos]) {
                  movingPos++;
              }
              if (movingPos < nums.length && nums[currPos] != nums[movingPos]) {
                  nums[currPos + 1] = nums[movingPos];
                  currPos++;
                  movingPos++;
              }
          }
          return currPos + 1;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null ) {
      return 0 ;
    }
    if ( var_0 . length <= 1 ) {
      return var_0 . length ;
    }
    int var_1 = 0 ;
    int var_2 = 1 ;
    while ( var_2 < var_0 . length ) {
      while ( var_2 < var_0 . length && var_0 [ var_1 ] == var_0 [ var_2 ] ) {
        var_2 ++ ;
      }
      if ( var_2 < var_0 . length && var_0 [ var_1 ] != var_0 [ var_2 ] ) {
        var_0 [ var_1 + 1 ] = var_0 [ var_2 ] ;
        var_1 ++ ;
        var_2 ++ ;
      }
    }
    return var_1 + 1 ;
  }
  