利用TreeMap有序特性实现没有重复元素的简单排序

package test;

import java.util.Comparator;
import java.util.Map;
import java.util.TreeMap;

public class TreeMapSort {
public static void main(String[] args) {
int[] a = {4,2,1,3,5,3,10};
Map<String,String> map = new TreeMap<String, String>(new Comparator<String>() {
public int compare(String o1, String o2) {
return Integer.parseInt(o1)>Integer.parseInt(o2)?1:-1;
}
});
for (int i : a) {
map.put(i+"", "");
}
for (String key: map.keySet()) {
System.out.print(key+",");
}
}
}