java.util.TreeMap.lowerEntry(K key) 方法示例 java.util.TreeMap.lastKey() 方法示例 java.util.TreeMap.lowerKey(K key) 方法示例 java.util.TreeMap.lowerEntry(K key) 方法示例 package com.codingdict; import java.util.*; public class TreeMapDemo { public static void main(String[] args) { // creating tree map TreeMap<Integer, String> treemap = new TreeMap<Integer, String>(); // populating tree map treemap.put(2, "two"); treemap.put(1, "one"); treemap.put(3, "three"); treemap.put(6, "six"); treemap.put(5, "five"); // getting lower entry System.out.println("Checking lower entry"); System.out.println("Value is: "+ treemap.lowerEntry(5)); } } java.util.TreeMap.lastKey() 方法示例 java.util.TreeMap.lowerKey(K key) 方法示例