comefrom: <awangdev>1213. Intersection of Three Sorted Arrays_2.java
code: public List<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {
          List<Integer> rst = new LinkedList<>();
          int i = arr1.length - 1, j = arr2.length - 1, k = arr3.length - 1;
          
          while (i >= 0 && j >= 0 && k >= 0) {
              if (arr1[i] == arr2[j] && arr2[j] == arr3[k]) {
                  if (rst.isEmpty() || arr1[i] != rst.get(rst.size() - 1)) rst.add(0, arr1[i]);
                  i--;
                  j--;
                  k--;
              } else if (arr2[j] < arr3[k]) k--; 
              else if (arr1[i] < arr2[j]) j--;
              else i--;
          }
          
          return rst;
      }
masked: public List < Integer > var_0 ( int [ ] var_1 , int [ ] var_2 , int [ ] var_3 ) {
    List < Integer > var_4 = new LinkedList < > ( ) ;
    int var_5 = var_1 . length - 1 , var_6 = var_2 . length - 1 , var_7 = var_3 . length - 1 ;
    while ( var_5 >= 0 && var_6 >= 0 && var_7 >= 0 ) {
      if ( var_1 [ var_5 ] == var_2 [ var_6 ] && var_2 [ var_6 ] == var_3 [ var_7 ] ) {
        if ( var_4 . isEmpty ( ) || var_1 [ var_5 ] != var_4 . get ( var_4 . size ( ) - 1 ) ) var_4 . add ( 0 , var_1 [ var_5 ] ) ;
        var_5 -- ;
        var_6 -- ;
        var_7 -- ;
      }
      else if ( var_2 [ var_6 ] < var_3 [ var_7 ] ) var_7 -- ;
      else if ( var_1 [ var_5 ] < var_2 [ var_6 ] ) var_6 -- ;
      else var_5 -- ;
    }
    return var_4 ;
  }
  