24 Lexicographic permutations - Project Euler +

package xxx.xxx.xxx;

/*
 * A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4.
 * If all of the permutations are listed numerically or alphabetically, we call it lexicographic order.
 * The lexicographic permutations of 0, 1 and 2 are:012   021   102   120   201   210
 * What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
 */
import java.util.ArrayList;


public class LexicographicPermutations {

ArrayList<Integer> digitsNum = null;
ArrayList<Integer> Factorial = new ArrayList<Integer>();
int[] bits = null;
int[] remainders = null;

public LexicographicPermutations(ArrayList<Integer> input){
digitsNum = input;
bits = new int[digitsNum.size()];
remainders = new int[digitsNum.size()];
for(int i = 0; i<digitsNum.size(); i++){
int num = digitsNum.size()-i;
int product= 1;
while(num>0){
product = product*num;
num--;
}
Factorial.add(product);
}
// System.out.println(Factorial);
}

private void compute(int position){

for(int i = 0; i<bits.length; i++){
bits[i] = position/Factorial.get(i);
remainders[i]=position%Factorial.get(i);
position=remainders[i];
}

ArrayList<Integer> results = new ArrayList<Integer>();
for(int i = 1; i<bits.length; i++){
results.add(digitsNum.get(bits[i]));
digitsNum.remove(bits[i]);
}
results.add(digitsNum.get(0));

for(int x:results){
System.out.print(x);

}

}




/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
long startTime = System.currentTimeMillis();
ArrayList<Integer> digitsNum = new ArrayList<Integer>(){{add(0); add(1);add(2); add(3);add(4); add(5);add(6); add(7);add(8); add(9);}};  
LexicographicPermutations l = new LexicographicPermutations(digitsNum);
l.compute(1000000-1);
long endTime = System.currentTimeMillis();
System.out.println("  execution time "+(endTime-startTime +"ms"));
}


}