java 排序 1和1_160308、java排序（形如1.1、1.2.1）

package com.rick.sample;

import java.util.ArrayList;

import java.util.Collections;

import java.util.Comparator;

import java.util.List;

public class SortUtilDemo {

public static void sortIdentify(List lists){

SortComparator sortComparator = new SortComparator();

Collections.sort(lists, sortComparator);

}

public static void main(String[] args) {

ArrayList lists = new ArrayList();

lists.add("1.1");

lists.add("1.2");

lists.add("1.2.1");

lists.add("3.1.2");

lists.add("2.6.6");

lists.add("2.6.3");

lists.add("1.10.1");

lists.add("1.10.2");

lists.add("1.10.1.2");

lists.add("1.1.1");

lists.add("10.1.1");

sortIdentify(lists);

for (String ids : lists) {

System.out.println(ids);

}

}

}

/**

* 重写排序接口

* @author Administrator

*/

class SortComparator implements Comparator{

@Override

public int compare(String pre, String suf) {

String[] preArrs = pre.split("\\.");

String[] sufArrs = suf.split("\\.");

int len = preArrs.length > sufArrs.length ? preArrs.length : sufArrs.length;

for (int i = 0; i < len; i++) {

int preNum = 0;

int sufNum = 0;

if (i < preArrs.length) {

preNum = Integer.parseInt(preArrs[i]);

}

if (i

sufNum = Integer.parseInt(sufArrs[i]);

}

if (preNum > sufNum) {

return 1;

} else if(preNum < sufNum){

return -1;

}

}

return 0;

}

}

原文：http://www.cnblogs.com/zrbfree/p/5253650.html