//import java.util.Scanner;

public class App {

public static void main(String[] args) {

P0047Permutation2 p47 = new P0047Permutation2();

System.out.println(p47.permuteUnique(new int[]{1,1,2}));

// P0133CloneGraph p133 = new P0133CloneGraph();

// System.out.println(p133.cloneGraph(new Node(1,list)));

// P0226InvertBinaryTree p226=new P0226InvertBinaryTree();

// BinaryTree bt=new BinaryTree(new Integer[]{4,2,7,1,3,6,9});

// BinaryTree bt1=new BinaryTree(new Integer[]{2,1,3});

// BinaryTree bt2=new BinaryTree(new Integer[]{});

// BinaryTree.printTree(p226.invertTree1(bt.root));

// System.out.println();

// P0235AncestorOfaBST p235 = new P0235AncestorOfaBST();

// BinarySearchTree bt = new BinarySearchTree(new int[]{6,2,8,0,4,7,9,3,5});

// TreeNode p = new TreeNode(2);

// TreeNode q = new TreeNode(4);

// BinarySearchTree.printTree(p235.lowestCommonAncestor5(bt.root, p,q));

/*

Scanner scanner = new Scanner(System.in);

System.out.print("Please input a number: ");

int N = scanner.nextInt();

System.out.printf("The input int is: %d%n", N);

System.out.println("end");

scanner.close();

*/

// BinaryTree t = new BinaryTree(new Integer[] {1,7,0,7,-8,null,null});

// P1161maxLevelSumOfABT s = new P1161maxLevelSumOfABT();

// s.maxLevelSum(t.root);

// SortArrays sort=new SortArrays();

// int[]res=sort.selectSort(new int[]{5,2,3,1});

// for(int i:res){

// System.out.print(i+" ");

// }

/*

* BinaryTree bt2=new BinaryTree(new Integer[]{1,1});

* P1022BTreeBinaryNum p1022 = new P1022BTreeBinaryNum();

* System.out.println(p1022.sumRootToLeaf(bt2.root));;

*/

}

}