穷举所有的二进制数。输入一个小于10的正整数n，按把每个元素都交换到最前面一次的方法，输出前n个小写字母的所有排列。-Enter a positive integer n is less than 10, according to the exchange of each element to the top of the first method, and output the first n lowercase letters all the permutations.