Java中取多個集合的交集和並集__Java

來源:互聯網
上載者:User
//取多個集合的交集
private Set<String> getIntersection(List<List<String>> list ) {
Set<String> set = new HashSet<String>();
int size = list.size();
if(size > 1){
//取集合中的交集 for (int i = 0; i < size; i++) { int j = i+1; if(j < size ){ list.get(0).retainAll(list.get(j));  if(i == size - 2){ List<String> resultList = list.get(0); for (String name : resultList) { set.add(name); } } } } }else {
//只有一個集合則不取交集 for (List<String> list2 : list) { for (String name : list2) { set.add(name); } } }

return set;

}



// 求多個集合的並集
private Set<String> getUnion(List<List<String>> list) {

Set<String> set = new HashSet<String>();

if(list == null){list = new ArrayList<List<String>>();}

int size = list.size();

if(size > 1){

for (int i = 0; i < size; i++) {

int j = i+1;

if(j < size ){

list.get(0).removeAll(list.get(j)); 

list.get(0).addAll(list.get(j)); 

if(i == size - 2){

List<String> resultList = list.get(0);

for (String name : resultList) {

set.add(name);

}

}

}

}

}else {

//只有一個集合則直接插入結果

for (List<String> list2 : list) {

for (String name : list2) {

set.add(name);

}

}

}

return set;

}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.