comefrom: <awangdev>46. Permutations_5.java
code: private void populateQueue(Queue<List<Integer>> queue, List<Integer> list, int[] nums) {
  
          for (int num : nums) {
              if (list.contains(num)) continue; 
              list.add(num);
              queue.offer(new ArrayList<>(list));
              list.remove(list.size() - 1);
          }
      }
masked: private void var_0 ( Queue < List < Integer >> var_1 , List < Integer > var_2 , int [ ] var_3 ) {
    for ( int var_4 : var_3 ) {
      if ( var_2 . contains ( var_4 ) ) continue ;
      var_2 . add ( var_4 ) ;
      var_1 . offer ( new ArrayList < > ( var_2 ) ) ;
      var_2 . remove ( var_2 . size ( ) - 1 ) ;
    }
  }
  