java 集合差运算_用Java的Set实现交并差等集合运算

本文介绍了如何使用Java的Set接口实现集合的交集、并集、差集和对称差集操作。通过示例代码展示了如何创建和操作Set集合,包括判断集合的子集和超集关系。
摘要由CSDN通过智能技术生成

放码过来

package com.lun.util;

import java.util.HashSet;

import java.util.Set;

public class SetUtils {

public static Set union(Set setA, Set setB) {

Set tmp = new HashSet(setA);

tmp.addAll(setB);

return tmp;

}

public static Set intersection(Set setA, Set setB) {

Set tmp = new HashSet();

for (T x : setA)

if (setB.contains(x))

tmp.add(x);

return tmp;

}

public static Set difference(Set setA, Set setB) {

Set tmp = new HashSet(setA);

tmp.removeAll(setB);

return tmp;

}

public static Set symDifference(Set setA, Set setB) {

Set tmpA;

Set tmpB;

tmpA = union(setA, setB);

tmpB = intersection(setA, setB);

return difference(tmpA, tmpB);

}

public static boolean isSubset(Set setA, Set setB) {

return setB.containsAll(setA);

}

public static boolean isSuperset(Set setA, Set setB) {

return setA.containsAll(setB);

}

public static void main(String args[]) {

HashSet set1 = new HashSet();

HashSet set2 = new HashSet();

set1.add('A');

set1.add('B');

set1.add('C');

set1.add('D');

set2.add('C');

set2.add('D');

set2.add('E');

set2.add('F');

System.out.println("set1: " + set1);

System.out.println("set2: " + set2);

System.out.println("Union: " + union(set1, set2));

System.out.println("Intersection: " + intersection(set1, set2));

System.out.println("Difference (set1 - set2): " + difference(set1, set2));

System.out.println("Difference (set2 - set1): " + difference(set2, set1));

System.out.println("Symmetric Difference: " + symDifference(set1, set2));

HashSet set3 = new HashSet(set1);

set3.remove('D');

System.out.println("set3: " + set3);

System.out.println("Is set1 a subset of set2? " + isSubset(set1, set3));

System.out.println("Is set1 a superset of set2? " + isSuperset(set1, set3));

System.out.println("Is set3 a subset of set1? " + isSubset(set3, set1));

System.out.println("Is set3 a superset of set1? " + isSuperset(set3, set1));

}

}

/* result:

set1: [A, B, C, D]

set2: [C, D, E, F]

Union: [A, B, C, D, E, F]

Intersection: [C, D]

Difference (set1 - set2): [A, B]

Difference (set2 - set1): [E, F]

Symmetric Difference: [A, B, E, F]

set3: [A, B, C]

Is set1 a subset of set2? false

Is set1 a superset of set2? true

Is set3 a subset of set1? true

Is set3 a superset of set1? false

*/

参考资料

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值