比如指定时间间隔为:
2020-11-11 ~ 2020-12-2
public static void main(String[] args) throws InterruptedException, ExecutionException
{
//逐日打印日期
LocalDate startDate = LocalDate.of(2020, 11, 11);
LocalDate endDate = LocalDate.of(2020, 12, 1);
/*
* 几种方法用来判断日期,isBefore()、isAfter()、isEqual()
*/
while(startDate.isBefore(endDate)||startDate.isEqual(endDate)){
System.out.println(startDate);
startDate = startDate.plusDays(1);
}
}
输出结果如下:
此时如果,map存放日期和Object类型的数据,返回的话日期不排序可对map定义时,定义可排序的map,代码如下:
Map<String, Object> dateNumMap = new TreeMap<String, Object>(
new Comparator<String>() {
@Override
public int compare(String obj1, String obj2) {
// 升序排序 如果降序则 obj2.compareTo(obj1)
return obj1.compareTo(obj2);
}
}); //不用new HashMap<>()是因为这样可以将下面存入的日期key(如:2021-11-12,2021-11-13)进行排序
DateTimeFormatter fmt = DateTimeFormatter.ofPattern("yyyy-MM-dd");//可用将LocalDate时间转成String类型
LocalDate startDate = LocalDate.of(2020, 11, 11);
LocalDate endDate = LocalDate.of(2020, 12, 2);
/*
* 几种方法用来判断日期,isBefore()、isAfter()、isEqual()
*/
while(startDate.isBefore(endDate)||startDate.isEqual(endDate)){
System.out.println(startDate);
dateNumMap.put(startDate.format(fmt), 自己逻辑所需的对象);
startDate = startDate.plusDays(1);
}
最终要实现的效果如下:
测试代码1:
public class TreeMapTest {
public static void main(String[] args) {
Map<String, Object> map = new TreeMap<String, Object>(
new Comparator<String>() {
@Override
public int compare(String obj1, String obj2) {
// 降序排序
return obj2.compareTo(obj1);
}
});
map.put("2019-03", "ccccc");
map.put("2018-12", "aaaaa");
map.put("2019-01", "bbbbb");
map.put("2019-02", "ddddd");
Set<String> keySet = map.keySet();
Iterator<String> iter = keySet.iterator();
while (iter.hasNext()) {
String key = iter.next();
System.out.println(key + ":" + map.get(key));
}
}
}
1输出结果:
2019-03:ccccc
2019-02:ddddd
2019-01:bbbbb
2018-12:aaaaa
测试代码2:
public class TreeMapTest {
public static void main(String[] args) {
Map<String, String> map = new TreeMap<String, String>();
map.put("c", "2019-03");
map.put("a", "2018-12");
map.put("b", "2019-01");
map.put("d", "2019-02");
//这里将map.entrySet()转换成list
List<Map.Entry<String,String>> list = new ArrayList<Map.Entry<String,String>>(map.entrySet());
//然后通过比较器来实现排序
Collections.sort(list,new Comparator<Map.Entry<String,String>>() {
//升序排序
@Override
public int compare(Map.Entry<String, String> o1,
Map.Entry<String, String> o2) {
return o1.getValue().compareTo(o2.getValue());
}
});
for(Map.Entry<String,String> mapping:list){
System.out.println(mapping.getKey()+":"+mapping.getValue());
}
}
}
2输出结果:
a:2018-12
b:2019-01
d:2019-02
c:2019-03
HashMap
我们都是HashMap的值是没有顺序的,他是按照key的HashCode来实现的。对于这个无序的HashMap我们要怎么来实现排序呢?参照TreeMap的value排序,我们一样的也可以实现HashMap的排序。
public class HashMapTest {
public static void main(String[] args) {
Map<String, String> map = new HashMap<String, String>();
map.put("c", "2019-03");
map.put("a", "2018-12");
map.put("b", "2019-01");
map.put("d", "2019-02");
List<Map.Entry<String,String>> list = new ArrayList<Map.Entry<String,String>>(map.entrySet());
Collections.sort(list,new Comparator<Map.Entry<String,String>>() {
//升序排序
@Override
public int compare(Map.Entry<String, String> o1,
Map.Entry<String, String> o2) {
return o1.getValue().compareTo(o2.getValue());
}
});
for(Map.Entry<String,String> mapping:list){
System.out.println(mapping.getKey()+":"+mapping.getValue());
}
}
}
输出如下
a:2018-12
b:2019-01
d:2019-02
c:2019-03