package Code01;
import org.w3c.dom.Node;
import org.w3c.dom.Text;
import java.util.HashMap;
import java.util.TreeMap;
public class timeComplexity {
// 时间复杂度 描述进行常数操作的次数
public static class Node{
public int value;
public Node(int v){
value = v;
}
}
//(K,V)表
public static void main(String[] args){
// 哈希表
HashMap<String,String> map = new HashMap<>();
map.put("love ye", "爱你");
System.out.println(map.containsKey("love ye"));
System.out.println(map.get("love ye"));
System.out.println("The answer is " + map.containsValue("爱你"));
System.out.println(map.containsValue("爱你"));
map.put("love ye", "爱的进行时");
System.out.println(map.containsKey("loving"));
System.out.println(map.get("love ye"));
map.put("test", "测试");
System.out.println((map.containsKey("test")));
System.out.println((map.containsValue("测试")));
System.out.println(map.get("test"));
map.remove("test");
System.out.println(map.containsKey("test"));
System.out.println(map.get("test"));
Node node1 = new Node(1);
Node node2 = new Node(1);
HashMap<Node, String> map3 = new HashMap<>();
map3.put(node1, "我进来了!");
System.out.println(map3.containsKey(node1));
System.out.println(map3.containsKey(node2));
// 有序表
TreeMap<Integer, String> map4 = new TreeMap<>();
map4.put(3, "我是3");
map4.put(0, "你是3");
map4.put(5, "我是3");
map4.put(2, "我是3");
map4.put(1, "我是3");
map4.put(7, "我是3");
map4.put(3, "你是3");
System.out.println(map4.get(3));
map4.remove(3);
System.out.println(map4.get(3));
// TreeMap内部会按照key值排好序
System.out.println(map4.firstKey());
System.out.println(map4.lastKey());
// <=5的离5最近的key返回
System.out.println(map4.floorKey(5));
// >=6的离6最近的key返回
System.out.println(map4.ceilingKey(6));
}
}
输出结果:
true
爱你
The answer is true
true
false
爱的进行时
true
true
测试
false
null
true
false
你是3
null
0
7
5
7Process finished with exit code 0