貌似基数排序

如给定数组{1,3,51,5,512,671,9,67}，设计程序，输出{9,671,67,512,51,5,3,1}

基本思想是给每一位数字定权重，然后使用如W[671] = 6 * w1 + 7 * w2 + 1 * w3;W的个数由数组中位数最长的数字决定。由数组中数字对应的权值来排序即可

程序如下：

import java.util.*;
import java.math.*;
public class Hello {
   public static List<Integer> sort(int[] arr)
   {
       String[] strs = new String[arr.length];
       int curLen = 0, maxLen = 0;
       for(int i = 0; i < strs.length; i++)
       {
           strs[i] = String.valueOf(arr[i]);
           curLen = strs[i].length();
           if(curLen > maxLen)
               maxLen = curLen;
       }
       HashMap<String,Integer> hm = new HashMap<String,Integer>();
       for(int i = 0; i < strs.length; i++)
       {
           hm.put(strs[i],0);
           for(int j = 0; j < strs[i].length(); j++)
           {
               hm.put(strs[i],hm.get(strs[i]) + (strs[i].charAt(j) - '0')*(int)Math.pow(10,maxLen - j));
           }
       }
       List<Map.Entry<String,Integer>> list = new ArrayList<Map.Entry<String,Integer>>();
       list.addAll(hm.entrySet());
       ValueComparator vc = new ValueComparator();
       Collections.sort(list,vc);
       List<Integer> intList = new ArrayList<Integer>();
       for(Iterator<Map.Entry<String,Integer>> it = list.iterator();it.hasNext();)
       {
            intList.add(Integer.valueOf(it.next().getKey()));   
       }
           
       return intList;
   }
    
   public static void main(String[] args) {
       int[] arr = {11,1,12,23,24,22,456,467,567};
       List<Integer> a =sort(arr);
       System.out.println(a);
   }
}

class ValueComparator implements Comparator<Map.Entry<String,Integer>>
{
    public int compare(Map.Entry<String,Integer> mp1,Map.Entry<String,Integer> mp2)
    {
        return mp2.getValue() - mp1.getValue();
    }
}