仅学习笔记记录,如有问题多多见谅
******************************
//数据结构
data class AlbumSelectionEntity @JvmOverloads constructor(
var id: Long = 0,
var path: String = "",
)
******************************
var aa=ArrayList<AlbumSelectionEntity>()
var bb=ArrayList<AlbumSelectionEntity>()
aa.add(AlbumSelectionEntity(id = 1,path = task1))
aa.add(AlbumSelectionEntity(id = 2,path = task2))
bb.add(AlbumSelectionEntity(id = 2,path = task2))
//拿到第一个ArrayList数据
var amap=HashMap<Long,AlbumSelectionEntity>()
aa.forEach {
amap[it.id]=it
}
//去掉第二个ArrayList和第一个ArrayList重合数据
bb.forEach {
if (amap.containsKey(it.id)){
amap.remove(it.id)
}else{
amap[it.id]=it
}
//输出两个ArrayList直接的差值
amap.forEach { t, u ->
Log.e("AlbumSelectionEntity", "data: $u")
}
******************************
//结果:
id:1,path:task1
******************************
09-08
5577
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)