Nav*_*a.s 1 java collections treemap
TreeMap treemap=new TreeMap<String,double>();
treemap.put("02.00", 7.5);
treemap.put("03.30", 7.9);
treemap.put("04.00", 8.0);
treemap.put("05.30", 6.8);
treemap.put("10.00", 9.01);
treemap.put("11.30", 8.9);
treemap.put("12.00", 9.30);
System.out.println(treemap);
double min=(double) Collections.min(treemap.values());
Run Code Online (Sandbox Code Playgroud)
树图包含 - {02.00 = 7.5,03.30 = 7.9,04.00 = 8.0,05.30 = 6.8,10.00 = 9.01,11.30 = 8.9,12.00 = 9.30} min包含值:6.8
现在我想迭代键和值
treemap.put("05.30", 6.8);
Run Code Online (Sandbox Code Playgroud)
即
treemap.put("10.00", 9.01);
treemap.put("11.30", 8.9);
treemap.put("12.00", 9.30);
Run Code Online (Sandbox Code Playgroud)
并将最后三个映射键和值存储在另一个树形图中..
TreeMap有一个方法tailMap(K fromKey),它返回一个SortedMap<K, V>键大于/等于K.