Java 集合详解

 

一、Java Collection接口

二、ArrayList 

clone功能

import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;

/**
 * Created by 10257527 on 2019/5/27.
 */
public class CollectionTest {
    public static void main(String[] args) {
        ArrayList cols  = new ArrayList();
        cols.add("1");
        cols.add(2);
        cols.add("A");
        cols.add("A");
        cols.add("B");
        cols.add("B");
        cols.add("C");
        cols.add("C");
        cols.add("D");
        ArrayList colc  = (ArrayList) cols.clone();//克隆cols集合
        Iterator it = cols.iterator();
        while(it.hasNext()){
            System.out.println(it.next());
        }
        Collection col2  = new ArrayList();
        col2.add("A");
        col2.add("A");
        col2.add("E");
        if(cols.contains("A")){
            System.out.println("包涵1");
        }
        if(cols.containsAll(col2)){
            System.out.println("包涵2");
        }

        System.out.println("----------------333");
        cols.retainAll(col2);
        Iterator it2 = cols.iterator();
        while(it2.hasNext()){
            System.out.println(it2.next());
        }

        System.out.println("----------------");
        colc.removeAll(col2);
        Iterator it1 = colc.iterator();
        while(it1.hasNext()){
            System.out.println(it1.next());
        }




        boolean flag = cols.isEmpty();
        System.out.println(flag);

    }
}


输入结果：
1
2
A
A
B
B
C
C
D
包涵1
----------------333
A
A
----------------
1
2
B
B
C
C
D
false

三、HashSet 

不会重复

import java.util.HashSet;
import java.util.Iterator;

/**
 * Created by 10257527 on 2019/5/24.
 */
public class HashSetTest {

    public static void main(String[] args) {
        HashSet set = new HashSet();
        set.add("2");
        set.add("2");
        set.add("2");
        set.add("2");

        Iterator it = set.iterator();
        while (it.hasNext()) {
            System.out.println(it.next());
        }
        System.out.println(set.size());


    }
}

输出结果:
2
1

 

 

四、HashMap 

import java.util.*;

/**
 * Created by 10257527 on 2019/5/28.
 */
public class HashMapTest {
    public static void main(String[] args) {

        HashMap   users = new HashMap();
        users.put("11","张浩太");    //将学生信息键值对存储到Map中
        users.put("22","刘思诚");
        users.put("33","王强文");
        users.put("44","李国量");
        users.put("55","王路路");
        System.out.println("******** 学生列表 ********");
        Iterator it = users.keySet().iterator();
        while (it.hasNext()){
            //System.out.println("学号："+ it.next()+":"+users.get(it.next()));
            //遍历 Map
            Object key=it.next();
            Object val=users.get(key);
            System.out.println("学号："+key+"，姓名:"+val);
        }


        Scanner input=new Scanner(System.in);
        System.out.println("请输入要删除的学号：");
        int num=input.nextInt();
        if(users.containsKey(String.valueOf(num)))
        {    //判断是否包含指定键
            users.remove(String.valueOf(num));    //如果包含就删除
        }
        else
        {
            System.out.println("该学生不存在！");
        }
        System.out.println("******** 学生列表 ********");
        Set<Map.Entry> set = users.entrySet();
        Iterator<Map.Entry> it2 = set.iterator();
        while (it2.hasNext()){
            Map.Entry mm =  it2.next();
            System.out.println("学号："+ mm.getKey()+"，姓名:"+ mm.getValue());
        }
    }
}