Java自定义比较器Comparator

1.数字排序 

奇数在前，偶数在后。奇数降序，偶数升序。输入：“0,1,2,3,4,5,6,7,8,9”        输出："9,7,5,3,1,0,2,4,6,8"

package com.sheepmu.text;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
  /*    
  * @author sheepmu
  */ 
public class HWCompetition {
	  public static void main(String[] args){
		  String s="0,1,2,3,4,5,6,7,8,9";  
		  System.out.println(getSort(  s));//9 7 5 3 1 0 2 4 6 8 
	  }  
	  public static String getSort(String s){
		  List<Integer>list=new ArrayList<Integer>();
		  String[] ss=s.split(",");
		  for(int i=0;i<ss.length;i++){
			  list.add(Integer.parseInt(ss[i]+"") );
		  }
		  Collections.sort(list