Java集合Set/byme

Code of HashSet:


package lp_2018_02_10_02;

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

public class aboutHashSet {
    public void paly() {
        HashSet lpHashSet = new HashSet();
        lpHashSet.add("Jack");
        lpHashSet.add("Eve");
        lpHashSet.add("Rose");
        lpHashSet.add("LiuPeng");
        lpHashSet.add("Jack");

        Iterator lpTierable = lpHashSet.iterator();
        while(lpTierable.hasNext()) {
            Object object = lpTierable.next();
            System.out.println(object.toString());
        }
    }
}
package lp_2018_02_10_02;

public class setDomon {
    public static void main(String [] args) {
        aboutHashSet lpList = new aboutHashSet();
        lpList.paly();
    }
}


Effect:


Code Of TreeSet:

package lp_2018_02_10_02;

import java.util.Iterator;
import java.util.TreeSet;

public class aboutTreeSet {
    public void paly() {
        TreeSet lpTreeSet = new TreeSet();
        lpTreeSet.add(100);
        lpTreeSet.add(60);
        lpTreeSet.add(80);
        lpTreeSet.add(120);
        //lpTreeSet.add("LiuPeng");

        Iterator lpItertor = lpTreeSet.iterator();
        while(lpItertor.hasNext()) {
            System.out.println(lpItertor.next().toString());
        }
    }
}
package lp_2018_02_10_02;

public class setDomon {
    public static void main(String [] args) {
        aboutTreeSet lpTree = new aboutTreeSet();
        lpTree.paly();


        /*
        aboutHashSet lpList = new aboutHashSet();
        lpList.paly();
        */
    }
}

Effect:



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值