算法：数的每个位数相乘等于给出的数，并且这个数是符合条件的数中最小的数

import java.util.ArrayList;
import java.util.List;


/*
 * 数的每个位数相乘等于给出的数，并且这个数是符合条件的数中最小的数
 * 输入36，输出49
 * 输入100，输出455
 */
public class One {
public static void main(String[] args) {


int input = 26;
List<Integer> outputs = new ArrayList<Integer>();
method(0, input, outputs, 0);
if (outputs.isEmpty()) {
System.out.println(-1);
} else {
/*
for(Integer i:outputs){
System.out.println(i);
}
*/
outputs = quickSort2(outputs,0,outputs.size()-1);
System.out.println(outputs.get(0));
}


/*
int[] array = { 229, 236, 263, 292, 326, 334, 343, 362, 49, 66, 94 };
array = quickSort(array, 0, array.length - 1);
for (int i : array) {
System.out.println(i);
}
*/
}


public static List<Integer> method(int little, int big, List<Integer> results, int curResult) {
if (big < 10) {
curResult = curResult * 10 + big;
results.add(curResult);
} else {
for (int i = 2; i < 10; i++) {
if (big % i == 0) {
method(i, big / i, results, curResult * 10 + i);
}
}
}
return results;
}


public static int[] quickSort(int[] array, int left, int right) {
if (left < right) {
int i = left;
int j = right;
int x = array[i];
while (i < j) {
while (i < j && x <= array[j])
j--;
if (i < j)
array[i++] = array[j];
while (i < j && array[i] < x)
i++;
if (i < j)
array[j--] = array[i];
}
array[i] = x;
quickSort(array, left, i - 1);
quickSort(array, i + 1, right);
}
return array;
}

public static List<Integer> quickSort2(List<Integer> array, int left, int right) {
if (left < right) {
int i = left;
int j = right;
int x = array.get(i);
while (i < j) {
while (i < j && x <= array.get(j))
j--;
if (i < j){
array.set(i, array.get(j));
}
while (i < j && array.get(i) < x)
i++;
if (i < j){
array.set(j, array.get(i));
j--;
}
}
array.set(i, x);
quickSort2(array, left, i - 1);
quickSort2(array, i + 1, right);
}
return array;
}
}