import java.util.*;
public class TestC {
public static void main(String[] args) {
List<String> names1 = new ArrayList<String>();
names1.add("Google ");
names1.add("Runoob ");
names1.add("Taobao ");
names1.add("Baidu ");
names1.add("Sina ");
// java8新特性排序 List<String> 排序
Collections.sort(names1,(a1,a2)->a1.compareTo(a2));
System.out.println(names1);
// java8新特性排序int[] 数组排序
int[] names4 = {3,1,5,2,9,8,4,10,6,7};
Integer[] names3 = new Integer[10];
for (int i = 0; i < names4.length; i++) {
names3[i] = names4[i];
}
//java8新特性 数组转换成List<> 使用Arrays.asList();
List<Integer> nums = Arrays.asList(names3);
//java8新特性 List<>转换成int[] 使用 (强转)数组对象.toArray();
Integer[] numsC = (Integer[])nums.toArray();
for (int i = 0; i < numsC.length; i++) {
System.out.print(numsC[i]+" || ");
}
System.out.println();
nums.sort(Comparator.reverseOrder()); //reverseOrder倒序
System.err.println("倒序:"+nums);//倒序:[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]
nums.sort(Comparator.naturalOrder());//naturalOrder自然排序即:正序
System.err.println("正序:"+nums);//正序:[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
//冒泡排序
int[] names5 = {3,1,5,2,9,8,4,10,6,7};
for (int i = 0; i < names5.length; i++) {
for (int j = 0; j < names5.length-1; j++) {
if(names5[j]>names5[j+1]){
int num=names5[j+1];
names5[j+1] = names5[j];
names5[j] = num;
}
}
}
for (int i = 0; i < names5.length; i++) {
System.out.print(names5[i]+" || ");
}
}
}
2. groupby的运用
public static void main(String[] args) {
List<Map<String,String>> list =new ArrayList<>();
for (int i = 0; i < 10; i++) {
Map<String,String> map = new HashMap<>();
map.put("1",i+"");
list.add(map);
}
Map<String, List<Map<String, String>>> collect = list.stream().collect(Collectors.groupingBy(p->p.get("1")));
System.err.println(collect);
System.err.println(collect.get("1"));
}