|
|
|
@ -88,3 +88,52 @@ public class JavaCollectionExample1 { |
|
|
|
集合中的元素: [] |
|
|
|
集合中的元素: [] |
|
|
|
``` |
|
|
|
``` |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
实例2: |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
```java |
|
|
|
|
|
|
|
import java.util.Collections; |
|
|
|
|
|
|
|
import java.util.HashSet; |
|
|
|
|
|
|
|
import java.util.Iterator; |
|
|
|
|
|
|
|
import java.util.Set; |
|
|
|
|
|
|
|
import java.util.concurrent.ConcurrentLinkedQueue; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public class JavaCollectionExample2 { |
|
|
|
|
|
|
|
public static void main(String[] args) { |
|
|
|
|
|
|
|
ConcurrentLinkedQueue<Integer> queue = new ConcurrentLinkedQueue<Integer>(); |
|
|
|
|
|
|
|
Set<Integer> set = new HashSet<>(); |
|
|
|
|
|
|
|
// 将指定集合的所有元素添加到调用集合中 |
|
|
|
|
|
|
|
Collections.addAll(set, 11, 12, 13, 14, 15); |
|
|
|
|
|
|
|
System.out.println("集合: " + set); |
|
|
|
|
|
|
|
// 返回按正确顺序对元素进行迭代的迭代器 |
|
|
|
|
|
|
|
Iterator<Integer> iterator = set.iterator(); |
|
|
|
|
|
|
|
while (iterator.hasNext()) { |
|
|
|
|
|
|
|
System.out.println(iterator.next()); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
set.clear(); |
|
|
|
|
|
|
|
// 检查集合是否为空 |
|
|
|
|
|
|
|
boolean isEmpty = set.isEmpty(); |
|
|
|
|
|
|
|
if (isEmpty) { |
|
|
|
|
|
|
|
System.out.println("集合为空"); |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
System.out.println("集合不为空"); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
for (int i = 1; i < 21; i++) { |
|
|
|
|
|
|
|
queue.add(i); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
System.out.println("集合中的元素: " + queue); |
|
|
|
|
|
|
|
for (int i = 1; i < 11; i++) { |
|
|
|
|
|
|
|
int j = i * 5; |
|
|
|
|
|
|
|
set.add(j); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
// 仅保留集合中与指定集合中存在的元素 |
|
|
|
|
|
|
|
queue.retainAll(set); |
|
|
|
|
|
|
|
System.out.println("5的倍数: " + queue); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
``` |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
输出结果: |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
```java |
|
|
|
|
|
|
|
``` |
|
|
|
|
|
|
|
|
|
|
|
|