/*相对于LinkedList
*ArrayList遍历容易,添加、删除麻烦
*
*/
List<String> list = new ArrayList<>();
list.add("李涛");//原第0个元素
list.add("李海萌");//原第1个元素
list.add("李大嘴");//原第2个元素
list.add(1, "陈冠希");//添加,后面依次后移一位。添加后是第1个元素for(String m:list){
System.out.println(m);
}
Set
/*
* Set 中不能放置重复的元素
* HashSet无序 TreeSet有序
*/
Set<Integer> set = new HashSet<>();
Random random = new Random();
int count = 0;
while(count<10){
int num = random.nextInt(90)+10;
set.add(num);
System.out.println("放完第"+count+"个数:"+num);
count++;
}
System.out.println("已经放置完毕");
Iterator<Integer> it = set.iterator();//迭代器方法while(it.hasNext()){
int i = it.next();
System.out.println(i);
}
Map
Map<String, Student> map = new HashMap<>();
//第一个参数是键值对,第二个参数是被添加的内容
map.put("张三", new Student("张三"));
map.put("李四", new Student("李四"));
map.put(null, new Student("张王五"));
Set<String> keys = map.keySet();
//第一种方法
System.out.println("方法一:");
Iterator<String> it = keys.iterator();
while(it.hasNext()){
String key = it.next();
System.out.println(key+"||"+map.get(key).getName());
}
//第二种方法
System.out.println("方法二:");
for(String key:map.keySet()){
System.out.println(key+"||"+map.get(key).getName());
}
Collections的排序方法sort()
List<Student> list = new ArrayList<>();//尖括号里面的叫泛型
list.add(new Student("战三",19));
list.add(new Student("李四", 20));
list.add(new Student("王五", 23));
list.add(new Student("赵六", 21));
list.add(new Student("马奇", 18));
list.add(new Student("小明", 22));
Collections.sort(list, new StuComparator());//升序
Collections.reverse(list);//排列倒置for(Student stu:list){
System.out.println(stu.getName()+"/"+stu.getAge());
}