1.
2.
3.
4.
5.
1)ArrayList
import java.util.ArrayList; import java.util.Iterator; public class ReviewTest01 { public static void main(String[] args) { //创建集合对象 ArrayList<String> list=new ArrayList<>(); //添加元素 list.add("zhangsan"); list.add("lisi"); list.add("wangerma"); //从集合中取出某一个元素 String firstList=list.get(0); System.out.println(firstList); //遍历(下标方式) //............................... for(int i=0;i<list.size();i++){ String elt=list.get(i); System.out.println(elt); } //............................... //遍历(迭代器方式) //............................... Iterator<String> it=list.iterator(); while(it.hasNext()){ System.out.println(it.next()); } //............................... //for循环代替while循环 //............................... for(Iterator<String> iterator=list.iterator();it.hasNext();){ System.out.println(it.next()); } //............................... //遍历(foreach方法) //............................... for (String s:list) { System.out.println(s); } } }
2)
import java.util.HashSet; import java.util.Iterator; import java.util.Objects; import java.util.Set; //无序,不可重复 public class ReviewTest02 { public static void main(String[] args) { HashSet<String> hashSet=new HashSet<>(); hashSet.add("zs"); hashSet.add("ls"); hashSet.add("ww"); Iterator<String> it=hashSet.iterator(); while(it.hasNext()){ System.out.println(it.next()); } for(String s:hashSet){ System.out.println(s); } Set<Student> stu=new HashSet<>(); Student s1=new Student("张三",21); Student s2=new Student("李四",22); Student s3=new Student("王五",23); stu.add(s1); stu.add(s2); stu.add(s3); System.out.println(stu.size()); for(Student student:stu){ System.out.println(student); } } } class Student{ private String name; private int age; public Student() { } public Student(String name, int age) { this.name = name; this.age = age; } public String getName() { return name; } public void setName(String name) { this.name = name; } public int getAge() { return age; } public void setAge(int age) { this.age = age; } @Override public String toString() { return "student{" + "name='" + name + '\'' + ", age=" + age + '}'; } @Override public boolean equals(Object o) { if (this == o) return true; if (o == null || getClass() != o.getClass()) return false; Student student = (Student) o; return age == student.age && Objects.equals(name, student.name); } @Override public int hashCode() { return Objects.hash(name, age); } }
3)TreeSet(可排序的不可重复的)
4)HashMap
import java.util.HashMap; import java.util.Map; import java.util.Set; public class ReviewTest03 { public static void main(String[] args) { //创建Map集合 Map<Integer, String> map = new HashMap<>(); //添加元素 map.put(1, "zs"); map.put(19, "ls"); map.put(21, "ww"); System.out.println(map.get(1)); System.out.println(map.get(21)); //遍历(先获取所有的key,遍历key的时候,通过key获取value) Set<Integer> keys = map.keySet(); for (Integer key : keys) { System.out.println(key + "=" + map.get(key)); } //第二种方法:将Map集合转换为Set集合,Set集合中每一个元素都是Node //这个nodes既有key也有value Set<Map.Entry<Integer,String>> nodes = map.entrySet(); for(Map.Entry<Integer,String> node:nodes){ System.out.println(node.getKey()+"="+node.getValue()); } } }
5)properties