<awangdev>46. Permutations_5.java
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);
        }
    }
private void var_0 ( Queue < List < Integer >> var_4 , List < Integer > var_5 , int [ ] var_6 ) {
  for ( int var_7 : var_6 ) {
    if ( var_5 . contains ( var_7 ) ) continue ;
    var_5 . add ( var_7 ) ;
    var_4 . offer ( new ArrayList < > ( var_5 ) ) ;
    var_5 . remove ( var_5 . size ( ) - 1 ) ;
  }
}
