ArrayList类
package Collection;
import java.util.*;
public class Example01 {
public static void main(String[] args) {
ArrayList list=new ArrayList();
list.add("ad ");
list.add("stu2");
list.add("stu3");
list.add("stu4");
System.out.println("集合的长度:"+list.size());//遍历长度
System.out.println("第2个元素是:"+list.get(1));//访问第已个元素
}
}
LinkedList类
package Collection;
import java.util.*;
public class Example02 {
public static void main(String[] args) {
LinkedList link=new LinkedList();
link.add("stul");
link.add("stu2");
link.add("stu3");
link.add("stu4");
System.out.println(link.toString());//取出打印集合中的元素;
link.add(3, "Student");//向集合第一个位置插入元素;
link.addFirst("First");//向集合第第一个位置插入元素;
System.out.println(link);
System.out.println(link.getFirst());//取第一个元素
link.remove(3);//删除第三个
link.removeFirst();//删除第一个
System.out.println(link);
}
}
Iterator接口
package Collection;
import java.util.*;
public class Example03 {
public static void main(String[] args) {
ArrayList list=new ArrayList();
list.add("1");
list.add("2");
list.add("3");
list.add("4");
Iterator it =list.iterator();
while(it.hasNext()) {//判断ArrayList中是否存在下个元素;
Object obj=it.next();//取出ArrayList中的元素;
System.out.println(obj);
}
System.out.println("==================");
for(int i=0;i<list.size();i++) {
Object a=list.get(i);
System.out.println(a);
}
System.out.println("===================");
for (Object object : list) {
System.out.println(object);
}
}
}
HashSet集合和TreeSet
(主要用于去重,如果存储的是对象,则需要重写HadhCode()和equals()方法)
package Collection;
import java.util.*;
public class Example08 {
public static void main(String[] args) {
HashSet ha=new HashSet();
teacher stu1=new teacher("1","jack");
teacher stu2=new teacher("2","tom");
teacher stu3=new teacher("2","tom");
ha.add(stu1);
ha.add(stu2);
ha.add(stu3);
System.out.println(ha);
}
}
class teacher{
String id;
String name;
public teacher(String id,String name) {//构造方法
this.id=id;
this.name=name;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((id == null) ? 0 : id.hashCode());
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;
teacher other = (teacher) obj;
if (id == null) {
if (other.id != null)
return false;
} else if (!id.equals(other.id))
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
public String toString() {//重写方法;
return id+":"+name;
}
}
Map接口
package Collection;
//对应 映射
import java.util.*;
public class Example10 {
public static void main(String[] args) {
Map map=new HashMap();
map.put("1","jack");
map.put("2","rose");
map.put("3","tom");
System.out.println(map.get("1"));
}
}
package Collection;
import java.util.*;
public class Example14 {
public static void main(String[] args) {
Map map=new LinkedHashMap();//创立Map集合
map.put("1", "jack");
map.put("2", "rose");
map.put("3", "lucy");
Set keySet=map.keySet();//创立键
Iterator it=keySet.iterator();///遍历键;
while(it.hasNext()) {
Object key=it.next();
Object value=map.get(key);
System.out.println(key+","+value);
}
}
}