一、List 元素有序(储存数据顺序与迭代顺序一致或相反)
1.Vector : 底层数组实现,线程安全,效率低
2.ArrayList : 底层数组实现,线程不安全,效率高,较LinkedList查询快,增删慢
3.LinkedList : 底层链表实现,线程不安全,效率高,较ArrayList增删快,查询慢
二、Set 元素具有唯一性
1.HashSet : 底层哈希表(元素是链表的数组)实现,哈希表依赖哈希值存储。不保证元素的迭代顺序。此类允许使用null值元素。添加功能底层依赖两个方法:hashCode()、equals()
2.TreeSet : 底层二叉树结构,元素有序(比较方法排序):
自然排序:元素对象实现Comparable接口,重写compareTo()方法
- import java.util.Comparator;
- import java.util.TreeSet;
- public class TreeSetTest1 {
- public static void main(String[] args) {
-
- TreeSet<Student> set = new TreeSet<Student>();
- set.add(new Student("年三",20));
- set.add(new Student("王一",15));
- set.add(new Student("牛二",20));
- set.add(new Student("三年",15));
- set.add(new Student("一王",17));
- set.add(new Student("二牛",20));
- for(Student s : set) {
- System.out.println(s);
- }
- }
- }
- class Student implements Comparable<Student>{
- private String name;
- private int age;
-
- public int compareTo(Student o) {
- if(this.age > o.age)
- return 1;
- else if(this.age < o.age)
- return -1;
- else
-
- return -1;
- }
- public Student(){}
- public Student(String name,int age){
- this.name = name;
- this.age = age;
- }
- public void setName(String name) {
- this.name = name;
- }
- public String getName() {
- return name;
- }
- public void setAge(int age) {
- this.age = age;
- }
- public int getAge() {
- return age;
- }
- public String toString() {
- return "Student [name="+name+",age="+age+"]";
- }
- public int hashCode() {
- final int prime = 31;
- int result = 1;
- result = prime * result + age;
- result = prime * result + ((name == null) ? 0 : name.hashCode());
- return result;
- }
- public boolean equals(Object obj) {
- if (this == obj)
- return true;
- if (obj == null)
- return false;
- if (getClass() != obj.getClass())
- return false;
- Student other = (Student) obj;
- if (age != other.age)
- return false;
- if (name == null) {
- if (other.name != null)
- return false;
- } else if (!name.equals(other.name))
- return false;
- return true;
- }
- }
比较器排序:比较器实现Comparator接口,重写compare()方法
- import java.util.Comparator;
- import java.util.TreeSet;
- public class TreeSetTest2 {
- public static void main(String[] args) {
-
- TreeSet<Student> set = new TreeSet<Student>(
-
- new Comparator<Student>() {
- public int compare(Student o1,Student o2) {
- if(o1.getAge() > o2.getAge())
- return -1;
- else if(o1.getAge() < o2.getAge())
- return 1;
- else
- return -1;
- }
- }
- );
- set.add(new Student("年三",20));
- set.add(new Student("王一",15));
- set.add(new Student("牛二",20));
- set.add(new Student("三年",15));
- set.add(new Student("一王",17));
- set.add(new Student("二牛",20));
- for(Student s : set) {
- System.out.println(s);
- }
- }
- }
- class Student{
- private String name;
- private int age;
- public Student(){}
- public Student(String name,int age){
- this.name = name;
- this.age = age;
- }
- public void setName(String name) {
- this.name = name;
- }
- public String getName() {
- return name;
- }
- public void setAge(int age) {
- this.age = age;
- }
- public int getAge() {
- return age;
- }
- public String toString() {
- return "Student [name="+name+",age="+age+"]";
- }
- public int hashCode() {
- final int prime = 31;
- int result = 1;
- result = prime * result + age;
- result = prime * result + ((name == null) ? 0 : name.hashCode());
- return result;
- }
- public boolean equals(Object obj) {
- if (this == obj)
- return true;
- if (obj == null)
- return false;
- if (getClass() != obj.getClass())
- return false;
- Student other = (Student) obj;
- if (age != other.age)
- return false;
- if (name == null) {
- if (other.name != null)
- return false;
- } else if (!name.equals(other.name))
- return false;
- return true;
- }
- }
3.LinkedHashSet
底层由哈希表和链表实现。哈希表保证元素的唯一性,链表保证元素具有可预知的迭代顺序
三、Map 存储键值对
1.HashMap
基于哈希表的Map实现,哈希表的作用是用来保证键的唯一性,键可以为null,值也可以为null,此实现是不同步的,效率高
2.TreeMap
键是二叉树结构,可以保证键的有序和唯一性,键不能为null(添加元素时,需要调用键的比较方法),值也不能为null
3.Hashtable
此类实现一个哈希表,哈希表将键映射到相应的值,键和值都不能为null(JDK1.0出现)
-
- import java.util.TreeMap;
- public class TreeMapTest {
- public static void main(String[] args) {
- TreeMap map = new TreeMap();
- map.put("one","1" );
- map.put("two", "2");
- map.put("three", "3");
-
- Set set1 = map.keySet();
- for(String v : set1) {
- System.out.println("——>"+v);
- }
-
- Set set2 = map.keySet();
- for(String k : set2) {
- System.out.println(k+"——>"+map.get(k));
- }
-
- Set<Map.Entry> set3 = map.entrySet();
- for(Map.Entry<String,String> e : set3) {
- System.out.println(e.getKey()+"——>"+e.getValue());
- }
- }
- }
四、Arrays类(数组工具类)
1.void sort(int[] a):对数组进行排序
2.int binarySearch(int[] a,int value):二分查找排好序的int类型数组中某个元素出现的下标
3.boolean deepEquals(Object[] o1,Object[] o2):比较两个数组的深度是否相等
4.void fill(int[] a,int value):将int类型数组中所有元素替换成指定int类型元素
5.int[] copyOf(int [] original,int newLength):复制数组中的元素,以使副本数组具有指定的长度
五、Collections类(集合工具类)
1.void sort(List list,Comparator c):使用比较器对集合进行排序
2.void shuffle(List list):打乱集合中的元素
3.T max(Collection c):获取集合中最大的元素
4.T min(Collection c):获取集合中最小的元素
5.void copy(List source,List target):将一个集合中的元素全部替换成指定的元素
六、泛型(Generic)
JDk 1.5开始,Java允许定义和使用泛型类、泛型接口、泛型方法
一种把类型明确的工作空间推迟到创建对象或者调用方法时明确,参数化类型的能力的特殊类型。
使用泛型的主要优点是能够在编译时而不是在运行时检测出错误
使用泛型来提高软件的可靠性和可读性
1.泛型类
- public class GenericTest1 {
- public static void main(String[] args) {
- GenericClass<Student> gc = new GenericClass<Student>();
- gc.setObj(new Student("刘亦菲",20));
- System.out.println(gc.getObj());
- }
- }
-
- class GenericClass<T> {
- private T obj;
- public T getObj() {
- return obj;
- }
- public void setObj(T obj) {
- this.obj = obj;
- }
- }
- class Student {
- private String name;
- private int age;
- public Student() {
- }
- public Student(String name,int age) {
- this.name = name;
- this.age = age;
- }
- public void setName(String name) {
- this.name = name;
- }
- public String getName() {
- return name;
- }
- public void setAge() {
- this.age = age;
- }
- public int getAge() {
- return age;
- }
- public String toString() {
- return "String [name="+name+",age="+age+"]";
- }
- }
2.泛型接口
- public class GenericTest2 {
- public static void main(String[] args) {
- GenericInterface<String> gt = new Tool<String>();
- gt.show("123");
- }
- }
-
- interface GenericInterface<T> {
- public void show(T t);
- }
- class Tool<T> implements GenericInterface<T> {
- public void show(T t) {
- System.out.println(t);
- }
- }
3.泛型通配符
- import java.util.Collection;
- import java.util.ArrayList;
- public class GenericTest3 {
- public static void main(String[] args) {
- Collection<Object> c1 = new ArrayList<Object>();
-
- Collection<?> c2 = new ArrayList<Object>();
-
- Collection<? extends Animal> c3 = new ArrayList<Animal>();
- Collection<? extends Animal> c4 = new ArrayList<Dog>();
-
- Collection<? super Animal> c5 = new ArrayList<Animal>();
- Collection<? super Animal> c6 = new ArrayList<Object>();
- }
- }
- class Animal {
- }
- class Dog extends Animal {
- }
- class Cat extends Animal {
- }