假設一個List里面包含多個List:<"apple", "banana">,<"ball", "pen"> <"apple", "orange">, <"grape", "orange">,<"paper","ruler">,<"ink","pen">如何將每個List進行重復比對，并將含有相同元素的List合并，最后形成一個新的List>：<"apple","banana","orange","grape">,,<"paper","ruler">也可理解為："A=B","C=D","A=E","F=E","G=H","I=D" => "A=B=E=F","C=D=I","G=H"請諸位不吝指教，謝謝！
3 回答
翻過高山走不出你
TA貢獻1875條經驗 獲得超3個贊
（1）Colletions.disjoint來判斷是否有交集
（2）在有交集的時候進行合并，合并的時候轉換為不重復的集合類Set，使用Set的addAll方法合并
添加回答
舉報
0/150
提交
取消