基数排序

public class RadixSort {
public int[] radixSort(int[] A, int n) {
// write code here
List<List<Integer>> radixList = new ArrayList<>();
for (int i = 0; i < 10; i++) {
radixList.add(i, new ArrayList<Integer>());
}
for(int i = 1; i<=4;i++){  //数字为0~10000 此i为从个位起的第i位数
for(int j =0; j< n ;j++){
int tmp =(int) (A[j]/(Math.pow(10,i-1))) %10;  //第i位的 数值
radixList.get(tmp).add(A[j]);
}
int index = 0;

for (int k = 0; k < 10; k++) {
while(radixList.get(k).size()!=0){
A[index++] = radixList.get(k).get(0);
radixList.get(k).remove(0);
}
}
}
return A;
}
}