comefrom: <awangdev>1033. Moving Stones Until Consecutive_1.java
code: public int[] numMovesStones(int a, int b, int c) {
          int[] arr = new int[]{a, b, c};
          Arrays.sort(arr);
          int max = arr[2] - arr[0] - 2;
          if (arr[2] - arr[0] == 2) return new int[]{0, max};
          if (arr[1] - arr[0] <= 2 || arr[2] - arr[1] <= 2) return new int[]{1, max};
          return new int[]{2, max};
      }
masked: public int [ ] sample_funcname ( int var_0 , int var_1 , int var_2 ) {
    int [ ] var_3 = new int [ ] {
      var_0 , var_1 , var_2 };
      Arrays . sort ( var_3 ) ;
      int var_8 = var_3 [ 2 ] - var_3 [ 0 ] - 2 ;
      if ( var_3 [ 2 ] - var_3 [ 0 ] == 2 ) return new int [ ] {
        0 , var_8 };
        if ( var_3 [ 1 ] - var_3 [ 0 ] <= 2 || var_3 [ 2 ] - var_3 [ 1 ] <= 2 ) return new int [ ] {
          1 , var_8 };
          return new int [ ] {
            2 , var_8 };
          }
          