Java--HashMap排序

 package connection;

 import java.util.Collections;
 import java.util.Comparator;
 import java.util.HashMap;
 import java.util.LinkedHashMap;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.Map;
 import java.util.Map.Entry;

 public class Test {

     public static void main(String[] args) {
         Map<String, String> userMap = new HashMap<String, String>();
         userMap.put("cn-1410165inv", "E141@0165#inv");
         userMap.put("cn-3330147inv", "E333@0147#inv");
         userMap.put("cn-1410165invkio", "J02amN$8");
         userMap.put("cn-1410165invrob", "U1SzpU+m");
         userMap.put("cn-3330147invkio", "J6]bJK,c");
         userMap.put("cn-3330147invrob", "W0zr%Y,q");

         for(Map.Entry<String, String> s : userMap.entrySet()) {
             System.out.println(s.getKey() + "    " + s.getValue());
         }

         List<Map.Entry<String, String>> sortList = new LinkedList<Map.Entry<String,String>>(userMap.entrySet());
         Collections.sort(sortList, new Comparator<Map.Entry<String, String>>() {

             @Override
             public int compare(Entry<String, String> o1, Entry<String, String> o2) {
                 String suffix1 = o1.getKey().split("-\\d+")[1];
                 String suffix2 = o2.getKey().split("-\\d+")[1];
                 int len1 = suffix1.length();
                 int len2  = suffix2.length();
                 if(len1 != len2) {
                     return len1-len2;
                 }
                 int min = len1>=len2?len2:len1;
                 for(int i=0; i<min; i++) {
                     String c1 = suffix1.substring(i, i+1);
                     String c2 = suffix2.substring(i, i+1);
                     if(c1.toCharArray()[0] - c2.toCharArray()[0] == 0) {
                         continue;
                     } else {
                         return c1.toCharArray()[0] - c2.toCharArray()[0];
                     }
                 }
                 //continue
                 len1 = o1.getKey().length();
                 len2  = o2.getKey().length();
                 if(len1 != len2) {
                     return len1-len2;
                 }
                 min = len1>=len2?len2:len1;
                 for(int i=0; i<min; i++) {
                     String c1 = o1.getKey().substring(i, i+1);
                     String c2 = o2.getKey().substring(i, i+1);
                     if(c1.toCharArray()[0] - c2.toCharArray()[0] == 0) {
                         continue;
                     } else {
                         return c1.toCharArray()[0] - c2.toCharArray()[0];
                     }
                 }
                 return 0;
             }
         });

         System.out.println("--------------------------------------");
         Map<String, String> sortMap = new LinkedHashMap<String, String>();
         for(Entry<String, String> entry: sortList) {
             sortMap.put(entry.getKey(), entry.getValue());
         }
         for(Map.Entry<String, String> s : sortMap.entrySet()) {
             System.out.println(s.getKey() + "    " + s.getValue());
         }

     }

 }

颜色区域是关键代码。