直接上代码List组合排序
import java.text.Collator;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class Test {
public static void main(String[] args) {
// 相同名字不同类型的数据组合排序,优先排序点击量(当点击量相同排时长)
//最终结果[{CNT=43, NAME=文档点击量}, {CNT=25, NAME=文档使用时长}, {CNT=42, NAME=CG素材点击量}, {CNT=30, NAME=CG素材使用时长}, {CNT=41, NAME=视频点击量}, {CNT=35, NAME=视频使用时长}]
Map<String, String> map2 = new HashMap<String, String>();
map2.put("NAME", "视频点击量");
map2.put("CNT", "41");
Map<String, String> map3 = new HashMap<String, String>();
map3.put("NAME", "文档点击量");
map3.put("CNT", "43");
Map<String, String> map1 = new HashMap<String, String>();
map1.put("NAME", "CG素材点击量");
map1.put("CNT", "42");
Map<String, String> map4 = new HashMap<String, String>();
map4.put("NAME", "CG素材使用时长");
map4.put("CNT", "30");
Map<String, String> map6 = new HashMap<String, String>();
map6.put("NAME", "文档使用时长");
map6.put("CNT", "25");
Map<String, String> map5 = new HashMap<String, String>();
map5.put("NAME", "视频使用时长");
map5.put("CNT", "35");
List<Map<String, String>> list = new ArrayList<Map<String,String>>();
list.add(map2);
list.add(map3);
list.add(map1);
list.add(map5);
list.add(map4);
list.add(map6);
listRegroup(list);
System.out.println(list);
}
public static List<Map<String,String>> listRegroup(List<Map<String,String>> list){
Collections.sort(list, new Comparator<Map<String,String>>() {
@Override
public int compare(Map<String,String> o1, Map<String,String> o2) {
/**
* 名字组合排序
*/
Collator collator = Collator.getInstance();
return collator.getCollationKey(o1.get("NAME")).compareTo(
collator.getCollationKey(o2.get("NAME")));
}
});
List<Map<String,String>> listString1 = new ArrayList<>(list);
System.out.println("------------------");
compareList(listString1, list);
for (Map<String,String> entity : listString1) {
System.out.print(entity.get("CNT"));
System.out.println(entity.get("NAME"));
}
return listString1;
}
public static void compareList(List<Map<String,String>> listString1,List<Map<String,String>> list){
for (int i = 0; i < list.size(); i++) {
if(i%2==0){
// 判断当前点击量与下一组点击量大小,小于则当前组合向后移动
if((i+2)<list.size()){
if(Integer.parseInt(list.get(i).get("CNT").toString())<Integer.parseInt(list.get(i+2).get("CNT").toString())){
Collections.swap(listString1, i, i+2);
Collections.swap(listString1, i+1, i+3);
Collections.swap(list, i, i+2);
Collections.swap(list, i+1, i+3);
compareList(listString1, list);
break;
}else if(Integer.parseInt(list.get(i).get("CNT").toString()) == Integer.parseInt(list.get(i+2).get("CNT").toString())){
if((i+2)<list.size()){
if(Integer.parseInt(list.get(i+1).get("CNT").toString())<Integer.parseInt(list.get(i+3).get("CNT").toString())){
Collections.swap(listString1, i, i+2);
Collections.swap(listString1, i+1, i+3);
Collections.swap(list, i, i+2);
Collections.swap(list, i+1, i+3);
compareList(listString1, list);
break;
}
}
}
}
}
}
return;
}
/**
* 调换集合中两个指定位置的元素, 若两个元素位置中间还有其他元素,需要实现中间元素的前移或后移的操作。
* @param list 集合
* @param oldPosition 需要调换的元素
* @param newPosition 被调换的元素
* @param <T>
*/
public static <T> void swap2(List<T> list, int oldPosition, int newPosition){
if(null == list){
throw new IllegalStateException("The list can not be empty...");
}
// 向前移动,前面的元素需要向后移动
if(oldPosition < newPosition){
for(int i = oldPosition; i < newPosition; i++){
Collections.swap(list, i, i + 1);
}
}
// 向后移动,后面的元素需要向前移动
if(oldPosition > newPosition){
for(int i = oldPosition; i > newPosition; i--){
Collections.swap(list, i, i - 1);
}
}
}
}