这是集合最后的总结啦
有不足请指正哈~
虚心学习~
前面有集合完整的,可以从前往后看哦~
目录
目录
ArrayList LinkedList
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
public class ArrayListLinkedList {
public static void main(String[] args) {
//ArrayList<String> list=new ArrayList();
LinkedList<String> list=new LinkedList<>();
list.add("515");
list.add("飞");
list.add("xig");
//第一种遍历方式:for循环
for(int i=0;i<list.size();i++){
System.out.println(list.get(i));
}
//第二种遍历方式:迭代器
Iterator<String> it=list.iterator();
while(it.hasNext()){
System.out.println(it.next());
}
//加强for循环
for (String s:list
) {
System.out.println(s);
}
}
}
TreeSet
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetTest {
public static void main(String[] args) {
//TreeSet<Integer> set=new TreeSet<>();升序
TreeSet<Integer> set=new TreeSet<>(new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2-o1;//降序
}
});
set.add(500);
set.add(100);
set.add(500);
set.add(200);
set.add(300);
set.add(700);
//第一种遍历:迭代器//自动升序
Iterator it= set.iterator();
while(it.hasNext()){
System.out.println(it.next());
}
//第二种:加强for
for (Integer s:set
) {
System.out.println(s
);
}
}
}
import java.util.TreeSet;
//自定义类实现比较功能 方法一:实现Comparable接口
public class TreeSetTest01 {
public static void main(String[] args) {
TreeSet<A> set=new TreeSet<>();
set.add(new A(5));
set.add(new A(1));
set.add(new A(5));
set.add(new A(3));
set.add(new A(2));
for (A a:set
) {
System.out.println(a);
}
}
}
class A implements Comparable<A>{
int i;
public A(int i) {
this.i = i;
}
@Override
public String toString() {
return "A{" +
"i=" + i +
'}';
}
@Override
public int compareTo(A o) {
// return this.i-o.i;//升序
return o.i-this.i;//降序
}
}
import java.util.Comparator;
import java.util.TreeSet;
//自定义类实现比较功能 方法二:实现comparator比较器
public class TreeSetTest02 {
public static void main(String[] args) {
TreeSet<B> set=new TreeSet<>(new BComparator());//需要传入比较器
set.add(new B(5));
set.add(new B(4));
set.add(new B(6));
set.add(new B(6));
for (B b:
set) {
System.out.println(b);
}
}
}
class B {
int i;
public B(int i) {
this.i = i;
}
@Override
public String toString() {
return "B{" +
"i=" + i +
'}';
}
}
class BComparator implements Comparator<B>{
@Override
public int compare(B o1, B o2) {
return o1.i-o2.i;
}
}
import java.util.Comparator;
import java.util.TreeSet;
public class TreeSetTest03 {
public static void main(String[] args) {
TreeSet<C> set=new TreeSet<>(new Comparator<C>() {//直接在当前位置重写方法,不用再新建一个类
@Override
public int compare(C o1, C o2) {
return o1.i-o2.i;
}
});//需要传入比较器
set.add(new C(5));
set.add(new C(4));
set.add(new C(6));
set.add(new C(6));
for (C b:
set) {
System.out.println(b);
}
}
}
class C{
int i;
public C(int i) {
this.i = i;
}
@Override
public String toString() {
return "C{" +
"i=" + i +
'}';
}
}
HashMap
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
public class HashMapTest {
public static void main(String[] args) {
HashMap<Integer,String> map=new HashMap<>();
map.put(002,"xiaotian");
map.put(003,"xiaoming");
map.put(001,"xiaoming");
map.put(002,"xiaohong");
//遍历第一种方式:先获取所有的key,遍历key,通过key获取value
Set<Integer> keys =map.keySet();//获取所有的key
for (Integer key :
keys ) {
System.out.println(key+"="+map.get(key));
}
//第二种方式:将map集合转换成set集合,set集合中每一个元素都是node(Map.Entry<Integer,String>)
Set<Map.Entry<Integer,String>> nodes=map.entrySet();
for (Map.Entry<Integer,String> node:nodes
) {
System.out.println(node);
}
}
}
HashSet
import java.util.HashSet;
import java.util.Iterator;
import java.util.Objects;
public class HashSetTest {
public static void main(String[] args) {
HashSet<Student> set=new HashSet<>();
Student s1=new Student(22,"小明");
Student s2=new Student(21,"小红");
Student s3=new Student(22,"小红");
set.add(s1);
set.add(s2);
set.add(s3);
System.out.println(set.size());
//遍历第一种:迭代器(Set集合没有下标,所以不能for循环)
Iterator<Student> it=set.iterator();
while(it.hasNext()){
System.out.println(it.next());
}
//遍历第二种:加强for循环
for (Student s:set
) {
System.out.println(s);
}
}
}
class Student {
String name;
int no;
public Student() {
}
public Student(int no,String name) {
this.name = name;
this.no = no;
}
@Override
public String toString() {
return "Student{" +
"name='" + name + '\'' +
", no=" + no +
'}';
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Student student = (Student) o;
return no == student.no && Objects.equals(name, student.name);
}
@Override
public int hashCode() {
return Objects.hash(name, no);
}
}
Properties
import java.util.Properties;
public class PropertiesTest {
public static void main(String[] args) {
Properties pro=new Properties();
pro.setProperty("账号","123");
pro.setProperty("密码","ss");
String username=pro.getProperty("账号");
String password=pro.getProperty("密码");
System.out.println(username);
System.out.println(password);
}
}