思路： 在Java中，排序需要复写的是 equals 方法 和 Comparable<T> 接口 的public int compareTo(T o); 方法
步骤：
1. 使用正则表达式来判断数字，多个连续的数字作为一组,
2. 一次检索出数字组合，
3. 检出下一组数字,如果有,则进入步骤4，否则进入步骤6.
4. 如果两组数字出现的位置相等，并且前面部分的字符串相等，则进入第5步。否则break，跳到第6步.
5. 如果前面部分的字符串完全一致。则比较两个数字的大小，如果大小一致，则进入下一组，即步骤3.如果大小不一致，则可以比对出来大小，比较结束
6. 调用String的compareTo方法,病返回(流程结束)。
完整的代码如下：
import java.util.ArrayList;import java.util.Collections;import java.util.List;import java.util.regex.Matcher;import java.util.regex.Pattern;//包装器类public class OrderWrapper implements Comparable<OrderWrapper>{String name = null;public OrderWrapper(String name){this.name = name;}public String getName() {return name;}public void setName(String name) {this.name = name;}@Overridepublic String toString() {return String.valueOf(name);}@Overridepublic boolean equals(Object obj) {if(obj == this){return true;} if(obj instanceof OrderWrapper){OrderWrapper other = (OrderWrapper)obj;if(null == this.name){return false;} else {return this.name.equals(other.name);}}return false;}// 比较方法,相当于减法。 (return this - wrapper)public int compareTo(OrderWrapper wrapper) {if(null == wrapper){return 1;}// 直接相等if(this == wrapper || this.equals(wrapper)){return 0;}String name1 = this.name;String name2 = wrapper.name;// 特殊情形，name有一个为空的情况.if(null == name1){// 都为空，认为相对if(null == name2){return 0;} else {return -1;}} else if(null == name2){return 1;}// 中间 1-多个数字Pattern pattern = Pattern.compile("D*(d+)D*");Matcher matcher1 = pattern.matcher(name1);Matcher matcher2 = pattern.matcher(name2);//System.out.println(pattern.pattern());//int index1_step = 0;int index2_step = 0;while(matcher1.find()){String s1 = matcher1.group(1);String s2 = null;if(matcher2.find()){s2 = matcher2.group(1);}int index1 = name1.indexOf(s1, index1_step);int index2 = name2.indexOf(s2, index2_step);//index1_step = index1;index2_step = index2;// 索引相等的情况下if(index1 == index2){System.out.println("name1="+name1.length()+"nname2="+name2.length());System.out.println("index1="+index1+",index2="+index2);String pre1 = name1.substring(0, index1);String pre2 = name2.substring(0, index2);if(pre1.equals(pre2)){// long num1 = Long.parseLong(s1);long num2 = Long.parseLong(s2);//if(num1 == num2){// 比较下一组continue;} else {return (int)(num1 - num2);}} else {break;}} else {break;}}// 最后的情形.return this.name.compareTo(wrapper.name);}public static void testNew(){List<OrderWrapper> chinesesOrderList = new ArrayList<OrderWrapper>(); chinesesOrderList.add(new OrderWrapper("我们80后相亲奇遇记-1.mp3")); chinesesOrderList.add(new OrderWrapper("他80后相亲奇遇记-10.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-11.mp3")); chinesesOrderList.add(new OrderWrapper("啊80后相亲奇遇记-12.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-13.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-25.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-26.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-2.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-3.mp3")); chinesesOrderList.add(new OrderWrapper("我80后相亲奇遇记-4.mp3")); chinesesOrderList.add(new OrderWrapper("a80后相亲奇遇记-4.mp3")); //Collator collatorChinese = Collator.getInstance(java.util.Locale.CHINA); //collatorChinese = Collator.getInstance(java.util.Locale.CHINESE); // Collections.sort(chinesesOrderList, collatorChinese); Collections.sort(chinesesOrderList); System.out.println("中文+数字排序： = "); for (int i = 0; i < chinesesOrderList.size(); i++) { OrderWrapper chinese = chinesesOrderList.get(i); System.out.println("" + chinese); } }public static void main(String[] args) {testNew();}}
