【算法笔记】sort排序, map遍历

1. Arrays.sort();自定义排序规则

//{{1,2},{1,4},{2,3},{2,8}}
//按照第一位升序,第二位降序
Arrays.sort(people, new Comparator<int[]>() {
	@Override
	public int compare(int[] o1, int[] o2) {
		if (o1[0] != o2[0]) {
			return o1[0] - o2[0];//根据o1从小到大排序
		}else {
			return o2[1] - o1[1];//o1相同，根据o2从大到小排序
		}
	}
});

//{"3","34","9","91"}
//按照字符串字典序降序
Arrays.sort(str, new Comparator<String>() {
	@Override
	public int compare(String o1, String o2) {
		String str1 = o1+o2;
		String str2 = o2+o1;
		return str2.compareTo(str1);//比较字典序，从大到小进行排序
	}
});

2. map遍历

Map <String,String>map = new HashMap<String,String>();
map.put("四川", "成都");
map.put("吉林", "长春");
//entry
for(Map.Entry<String, String> entry : map.entrySet()){
    String mapKey = entry.getKey();
    String mapValue = entry.getValue();
    System.out.println(mapKey+":"+mapValue);
}

//key
for(String key : map.keySet()){
    System.out.println(key);
}
//value
for(String value : map.values()){
    System.out.println(value);
}