public class Test { public static void main(String[] args) { Set<Student> students = new HashSet<>(); Student student1 = new Student("张三", Student.MALE, 18, 1140); Student student2 = new Student("张四", Student.MALE, 19, 1130); Student student3 = new Student("张五", Student.FEMALE, 28, 1110); Student student4 = new Student("张六", Student.MALE, 17, 1120);
students.add(student1); students.add(student2); students.add(student3); students.add(student4); Set<Student> stu = new HashSet<>();
@Override public String toString() { return String.format("姓名:%s,性别:%s,年龄:%d,学号:%d\n",this.name,this.sex==0?"女":"男",this.age,this.id); }
public Student(String name, int sex, int age, int id) { this.name = name; this.sex = sex; this.age = age; this.id = id; }
public int getSex() { return sex; }
public int getAge() { return age; } }
Map
Map是以键值对(key:value)的形式存储数据,常用有jdbc中。
Map也是无序的,且键值要求是唯一的,如果有重复的键名,以最后出现的键值为准。
package 第2章_集合框架.Map;
import java.util.HashMap; import java.util.Map;
public class Test { public static void main(String[] args) { Map <String,Integer> map = new HashMap<>(); //添加数据 map.put("第一个数",1); map.put("第二个数",2); map.put("第三个数",3); map.put("第四个数",4); map.put("第五个数",5); map.put("第六个数",6); //查看元素个数 System.out.println(map.size()); //得到相对应键的值 System.out.println(map.get("第三个数")); //移除相对应键的值 map.remove("第四个数"); System.out.println(map); } }
迭代器(Iterator)
package 第2章_集合框架.迭代器;
import java.util.*;
public class Test { public static void main(String[] args) { List<String> list = new ArrayList<String>(); list.add("张三1"); list.add("张三2"); list.add("张三3"); list.add("张三4"); List<String> linkList = new LinkedList<String>(); linkList.add("link1"); linkList.add("link2"); linkList.add("link3"); linkList.add("link4");
Set<String> set = new HashSet<String>(); set.add("set1"); set.add("set2"); set.add("set3"); set.add("set4"); //使用迭代器遍历ArrayList集合 Iterator<String> listIt = list.iterator(); while (listIt.hasNext()) { System.out.println(listIt.next()); } //使用迭代器遍历Set集合 Iterator<String> setIt = set.iterator(); while (setIt.hasNext()) { System.out.println(setIt.next()); } //使用迭代器遍历LinkedList集合 Iterator<String> linkIt = linkList.iterator(); while (linkIt.hasNext()) { System.out.println(linkIt.next()); } } }