1.list中的常用方法:
mport java.util.ArrayList;
import java.util.List;
public class list {
public static void main(String[] args) {
List list =new ArrayList();
//增,list是一片有序的空间
list.add("a");
list.add("b");
list.add("c");
list.add(2,"d");
List list1 =new ArrayList();
list1.add("e");
list1.add("f");
list.addAll(3, list1);
//删除
list.remove(2);
//改
list.set(1, "x");
//查
System.out.println(list);
}
}
基调:它的底层是一片有序的空间,特点是:可以存放有序的,可重复的元素
2.set中的常用方法:
package 集合;
import java.util.HashSet;
import java.util.Set;
public class set {
public static void main(String[] args) {
//set,hashset是set的主要实现类,无序的,不可重复的
Set set =new HashSet();
set.add('a');
set.add("v");
set.add(4);
set.add("v");
System.out.println(set);
}
}
package 集合;
import java.util.HashSet;
import java.util.Set;
public class demo1 {
public demo1(String string, int i) {
}
private String name;
private int 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 "demo1 [name=" + name + ", age=" + age + "]";
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + age;
result = prime * result + ((name == null) ? 0 : name.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
demo1 other = (demo1) 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;
}
public static void main(String[] args) {
//因为重写了hashcode和equls算法,所以用set方法只有一个
//如果不重写的话,出现的值是两个,因为他们的地址不同,他们都是新的空间
demo1 d1 =new demo1("s",20);
demo1 d2 = new demo1("s",20);
Set set =new HashSet();
set.add(d2);
set.add(d1);
System.out.println(set);
}
}
基调:底层是一片连续的堆空间,特点是:可以存放无序的,不可重复的元素
3.map详解
package 集合;
import java.util.HashMap;
import java.util.Map;
public class student1 {
private String name;
private int age;
public student1(String name, int age) {
super();
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 "map [name=" + name + ", age=" + age + "]";
}
public static void main(String[] args) {
Map map =new HashMap();
student1 s1= new student1("小城",21);
student1 s2= new student1("小hei",22);
student1 s3= new student1("小画",23);
student1 s4=new student1("x",25);
//增
map.put(1710024126,s1);
map.put(1710024127,s2);
map.put(1710024128,s3);
//删除
Object re = map.remove(1710024126);
//改
map.put(1710024126,s4);
//查
Object obj = map.get(1710024126);
System.out.println(obj);
System.out.println(map);
//获得所有的键
Set ks = map.keySet();
System.out.println(ks);
}
}
其中获取所有键值的方法是非常重要的,务必记下来!
map的相关操作:
有错误的地方可以私信@我!,我也有很多资料,想要的可以私聊我,(免费)!开源精神