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_0 ( int [ ] var_1 , int [ ] var_2 , int [ ] var_3 ) {
    List < Integer > var_4 = new LinkedList < > ( ) ;
    int var_5 = 0 , var_6 = 0 , var_7 = 0 ;
    while ( var_5 < var_1 . length && var_6 < var_2 . length && var_7 < var_3 . length ) {
      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 ( var_1 [ var_5 ] ) ;
        var_5 ++ ;
        var_6 ++ ;
        var_7 ++ ;
      }
      else if ( var_1 [ var_5 ] < var_2 [ var_6 ] ) var_5 ++ ;
      else if ( var_2 [ var_6 ] < var_3 [ var_7 ] ) var_6 ++ ;
      else var_7 ++ ;
    }
    return var_4 ;
  }
  