s-day02-HashSet特点以及遍历
This commit is contained in:
@@ -0,0 +1,37 @@
|
||||
package com.inmind.set02;
|
||||
|
||||
import java.util.HashSet;
|
||||
import java.util.Iterator;
|
||||
|
||||
/*
|
||||
HashSet特点以及遍历
|
||||
HashSet就是Set集合的实现类,它的特点也是
|
||||
1.存取无序(怎么存的不一定怎么取)
|
||||
2.没有索引
|
||||
3.不能重复
|
||||
HashSet的底层实现是哈希表,就是一个HashMap(双列集合)
|
||||
*/
|
||||
public class HashSetDemo07 {
|
||||
public static void main(String[] args) {
|
||||
HashSet<String> sets = new HashSet<>();
|
||||
sets.add("刘备");
|
||||
sets.add("关羽");
|
||||
sets.add("张飞");
|
||||
System.out.println(sets);
|
||||
//获取set集合中的元素
|
||||
//Set集合没有get方法,数据如何获取??只能通过迭代器,转数组,之后的stream流操作
|
||||
//获取迭代器
|
||||
Iterator<String> iterator = sets.iterator();
|
||||
//while循环获取元素
|
||||
while (iterator.hasNext()) {
|
||||
String elment = iterator.next();
|
||||
System.out.println(elment);
|
||||
}
|
||||
//---------------------
|
||||
//增强for循环,foreach循环
|
||||
for (String e : sets) {
|
||||
System.out.println(e);
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user