进阶day03-HashSet特点以及遍历
This commit is contained in:
35
javaSE-day03/src/com/inmind/set02/HashSetDemo07.java
Normal file
35
javaSE-day03/src/com/inmind/set02/HashSetDemo07.java
Normal file
@@ -0,0 +1,35 @@
|
||||
package com.inmind.set02;
|
||||
|
||||
import java.util.HashSet;
|
||||
import java.util.Iterator;
|
||||
import java.util.Set;
|
||||
|
||||
/*
|
||||
HashSet特点以及遍历
|
||||
HashSet就是Set集合的实现类,它的特点也是
|
||||
1.存取无序(怎么存的不一定怎么取)
|
||||
2.没有索引
|
||||
3.不能重复
|
||||
HashSet的底层实现是哈希表,就是一个HashMap
|
||||
*/
|
||||
public class HashSetDemo07 {
|
||||
public static void main(String[] args) {
|
||||
//创建一个HashSet集合
|
||||
HashSet<String> sets = new HashSet<>();
|
||||
sets.add("刘备");
|
||||
sets.add("关羽");
|
||||
sets.add("张飞");
|
||||
System.out.println(sets);
|
||||
//Set集合是没有索引的,就无法通过普通for循环遍历,只能迭代器,foreach循环,后期可以使用Stream也可以
|
||||
Iterator<String> iterator = sets.iterator();
|
||||
//迭代器遍历
|
||||
while (iterator.hasNext()) {
|
||||
String next = iterator.next();
|
||||
System.out.println(next);
|
||||
}
|
||||
//语法糖foreach循环,替代迭代器来遍历
|
||||
for (String s : sets) {
|
||||
System.out.println(s);
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user