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