java过滤集合,java – 如何通过交集过滤集合集合？

这应该解决你的用例.它可以以更有效的方式实现,但我想这应该给你一个开始的想法：

private static Collection> mergeIntersections(Collection> collection) {

Collection> processedCollection = mergeIntersectionsInternal(collection);

while (!isMergedSuccessfully(processedCollection)) {

processedCollection = mergeIntersectionsInternal(processedCollection);

}

return processedCollection;

}

private static boolean isMergedSuccessfully(Collection> processedCollection) {

if (processedCollection.size() <= 1) {

return true;

}

final Set mergedNumbers = new HashSet<>();

int totalNumbers = 0;

for (Set set : processedCollection) {

totalNumbers += set.size();

mergedNumbers.addAll(set);

}

if (totalNumbers > mergedNumbers.size()) {

return false;

}

return true;

}

private static Collection> mergeIntersectionsInternal(Collection> collection) {

final Collection> processedCollection = new ArrayList<>();

// ITERATE OVER ALL SETS

for (final Set numberSet : collection) {

for (final Integer number : numberSet) {

boolean matched = false;

// ITERATE OVER ALL PROCESSED SETS COLLECTION

for (final Set processedSet : processedCollection) {

// CHECK OF THERE IS A MATCH

if (processedSet.contains(number)) {

matched = true;

// MATCH FOUND, MERGE THE SETS

processedSet.addAll(numberSet);

// BREAK OUT OF PROCESSED COLLECTION LOOP

break;

}

}

// IF NOT MATCHED THEN ADD AS A COLLECTION ITEM

if (!matched) {

processedCollection.add(new HashSet<>(numberSet));

}

}

}

return processedCollection;

}

这是它执行它的方式：

public static void main(String[] args) {

final Collection> collection = new ArrayList<>();

final Set set1 = new HashSet<>();

set1.add(1);

set1.add(2);

set1.add(3);

collection.add(set1);

final Set set2 = new HashSet<>();

set2.add(4);

collection.add(set2);

final Set set3 = new HashSet<>();

set3.add(1);

set3.add(5);

collection.add(set3);

final Set set4 = new HashSet<>();

set4.add(4);

set4.add(7);

collection.add(set4);

final Set set5 = new HashSet<>();

set5.add(3);

set5.add(5);

collection.add(set5);

System.out.println(mergeIntersections(collection));

}