java對(duì)象數(shù)組去重威兜；
- 將原數(shù)組插入到新數(shù)組的時(shí)候坑夯，將插入的對(duì)象和新數(shù)組中的已插入對(duì)象進(jìn)行比較，若不相同纽帖，則插入到新的數(shù)組中宠漩；
- 使用hashSet進(jìn)行對(duì)象的去重（需要將list中對(duì)象的hasCode()、equals()方法進(jìn)行重寫(xiě)抛计，然后放到set集合中）
package com.arraySort;
import java.util.ArrayList;
import java.util.List;
import java.util.Objects;
import java.util.stream.Collectors;
public class DistinctPerson {
private String name;
private int score;
public DistinctPerson(int score, String name) {
super();
this.name = name;
this.score = score;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getScore() {
return score;
}
public void setScore(int score) {
this.score = score;
}
/**
* 當(dāng)name相同哄孤，就認(rèn)定兩個(gè)對(duì)象相等
*
* @param o
* @return
*/
@Override
public boolean equals(Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
DistinctPerson that = (DistinctPerson) o;
return Objects.equals(name, that.name);
}
/**
* 僅使用name字段的值來(lái)生成hashcode；
*
* @return
*/
@Override
public int hashCode() {
return Objects.hash(name);
}
@Override
public String toString() {
return "DistinctPerson{" +
"name='" + name + '\'' +
", score=" + score +
'}';
}
private static List<DistinctPerson> initList() {
List<DistinctPerson> distinctPeople = new ArrayList<DistinctPerson>();
distinctPeople.add(new DistinctPerson(980, "M1"));
distinctPeople.add(new DistinctPerson(34, "M2"));
distinctPeople.add(new DistinctPerson(12, "M3"));
distinctPeople.add(new DistinctPerson(65, "M4"));
distinctPeople.add(new DistinctPerson(12, "M5"));
distinctPeople.add(new DistinctPerson(33, "M6"));
distinctPeople.add(new DistinctPerson(90, "M7"));
distinctPeople.add(new DistinctPerson(123, "M8"));
distinctPeople.add(new DistinctPerson(124, "M8"));
return distinctPeople;
}
private static void pirntList(String title, List<DistinctPerson> distinctPeople) {
System.out.println("==============" + title + "=================");
for (DistinctPerson distinctPerson : distinctPeople) {
System.out.println(distinctPerson.toString());
}
}
public static void main(String[] args) {
// 方法一：將原數(shù)組插入到新數(shù)組的時(shí)候吹截，將插入的對(duì)象和新數(shù)組中的已插入對(duì)象進(jìn)行比較，若不相同凝危，則插入到新的數(shù)組中波俄；
List<DistinctPerson> distinctPeople = initList();
List<DistinctPerson> newDistinctPeople = new ArrayList<>();
distinctPeople.forEach(t -> {
//anyMatch表示有一個(gè)匹配就返回true;
boolean match = newDistinctPeople.stream().anyMatch(u -> t.getName().equals(u.getName()));
if (!match) {
newDistinctPeople.add(t);
}
});
pirntList("方法一", newDistinctPeople);
/**
方法二：使用hashSet進(jìn)行對(duì)象的去重（需要將list中對(duì)象的hasCode()、equals()方法進(jìn)行重寫(xiě)蛾默，然后放到set集合中）
* 若對(duì)象中的equals方法的返回值為true懦铺，hashCode方法的返回值必定是相同的；
*/
distinctPeople = initList();
distinctPeople = distinctPeople.parallelStream().distinct().collect(Collectors.toList());
pirntList("方法二", distinctPeople);
}
}
運(yùn)行結(jié)果如下：
==============方法一=================
DistinctPerson{name='M1', score=980}
DistinctPerson{name='M2', score=34}
DistinctPerson{name='M3', score=12}
DistinctPerson{name='M4', score=65}
DistinctPerson{name='M5', score=12}
DistinctPerson{name='M6', score=33}
DistinctPerson{name='M7', score=90}
DistinctPerson{name='M8', score=123}
==============方法二=================
DistinctPerson{name='M1', score=980}
DistinctPerson{name='M2', score=34}
DistinctPerson{name='M3', score=12}
DistinctPerson{name='M4', score=65}
DistinctPerson{name='M5', score=12}
DistinctPerson{name='M6', score=33}
DistinctPerson{name='M7', score=90}
DistinctPerson{name='M8', score=123}
