LinkedList的特点
存储结构:双向链表,特点:链表结构实现,增删快,查询慢。
添加元素
//实例化
LinkedList linkedList=new LinkedList();
//1.增加元素
Student s1=new Student("刘德华",20);
Student s2=new Student("郭富城",24);
Student s3=new Student("梁朝伟",21);
Student s4=new Student("周星驰",25);
linkedList.add(s1);
linkedList.add(s2);
linkedList.add(s3);
linkedList.add(s4);
System.out.println("集合元素个数为:"+linkedList.size());
System.out.println(linkedList.toString());
删除元素
//2.删除元素
linkedList.remove(s1);
linkedList.remove(new Student("周星驰",25));
linkedList.clear();
System.out.println("集合元素个数为:"+linkedList.size());
System.out.println(linkedList.toString());
重写后的equals方法
@Override
public boolean equals(Object o) {//重写equals方法
if (this == o) //1.判断是否为同一个元素
return true;
if(o==null){//2.判断是否为空
return false;
}
//3.判断是否为Student类型
if(o instanceof Student){
Student s=(Student) o;
//4.比较属性
if(this.name.equals(s.getName())&&this.age==s.getAge()){
return true;
}
}
//5.不满足条件则返回false
return false;
}
遍历集合元素
//3.遍历元素
System.out.println("---------3.1 for循环遍历---------");
//3.1 for循环遍历
for (int i = 0; i < linkedList.size(); i++) {
System.out.println(linkedList.get(i));
}
//3.2 增强for循环遍历
System.out.println("---------3.2 增强for循环遍历---------");
for (Object o : linkedList) {
Student s=(Student) o;
System.out.println(s);
}
//3.3 迭代器遍历
System.out.println("---------3.3 迭代器遍历---------");
Iterator it=linkedList.listIterator();
while(it.hasNext()){
Student s=(Student) it.next();
System.out.println(s);
}
//3.4 列表迭代器遍历
System.out.println("---------3.4 列表迭代器遍历---------");
ListIterator lit=linkedList.listIterator();
while (lit.hasNext()){
Student s=(Student) lit.next();
System.out.println(s);
}
判断
//4 判断
System.out.println(linkedList.contains(s1));
System.out.println(linkedList.contains(new Student("周星驰",25)));
//建立在重写后的equals方法
System.out.println(linkedList.isEmpty());
获取集合元素下标
//5 获取元素下标
System.out.println(linkedList.indexOf(s1));
System.out.println(linkedList.indexOf(new Student("周星驰",25)));
//建立在重写后的equals方法