java list 查找元素,在Java中查找N个列表之间的公共元素

I need to write a Java program that finds the intersection (common elements) of an arbitrary number of lists or arrays of integers (of arbitrary length). I guess that Java Lists may have a useful method in order to achieve this, but I am taking a look at the API and can´t find it.

Any hint?

解决方案

You can find the common elements between two lists by copying the elements of one list into a new list, and using retainAll:

List commonElements = new ArrayList<>(list1);

commonElements.retainAll(list2);

This can be extended to n lists, since the common elements in n lists are the common elements of [the common elements of the first n-1 lists] and the [elements of the n-th list]:

commonElements.retainAll(list3);

commonElements.retainAll(list4);

...

e.g.

List commonElements(Iterable extends List extends T>> lists) {

Iterator extends List extends T>> it = lists.iterator();

List commonElements = new ArrayList(it.next());

while (it.hasNext()) {

commonElements.retainAll(it.next());

}

return commonElements;

}

Note that this will fail with a NoSuchElementException if lists is empty. It is straightforward to handle for this case, by adding a check for it.hasNext() before the first it.next().

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值