两个List合并去重 List＜Student＞

package com.test;
/**
 * user类
 * @author Magic
 *
 */
public class User {

	private String id;
	private String name;
	private String age;
	
	public User() {
		super();
	}

	public User(String id, String name, String age) {
		super();
		this.id = id;
		this.name = name;
		this.age = age;
	}

	public String getId() {
		return id;
	}

	public void setId(String id) {
		this.id = id;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public String getAge() {
		return age;
	}

	public void setAge(String age) {
		this.age = age;
	}

	@Override
	public String toString() {
		return "User [id=" + id + ", name=" + name + ", age=" + age + "]";
	}
}

main方法

package com.test;

import java.net.ConnectException;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Test5 {

	public static void main(String[] args) throws ConnectException, Exception {
		// new6个对象
		User user = new User("1", "小明", "15");
		User user2 = new User("2", "小王", "15");
		User user3 = new User("3", "小东", "15");
		User user4 = new User("4", "小米", "15");
		User user5 = new User("5", "小海", "15");
		User user6 = new User("6", "小天", "15");

		// 定义两个list
		List<User> list = new ArrayList<User>();
		list.add(user);
		list.add(user2);
		list.add(user3);
		list.add(user4);

		List<User> list2 = new ArrayList<User>();
		list2.add(user5);
		list2.add(user6);
		// 该实体在list中也存在
		list2.add(user);

		// 去重合并（实体）
		for (User bean : list) {
			Iterator<User> iterator = list2.iterator();
			while (iterator.hasNext()) {
				User next = iterator.next();
				// 如果ID一样即为同一条数据
				if (next.getId().equals(bean.getId())) {
					iterator.remove();
				}
			}
		}

		list.addAll(list2);
		System.out.println(list);

	}
}

执行结果

[User [id=1, name=小明, age=15], User [id=2, name=小王, age=15], User [id=3, name=小东, age=15], User [id=4, name=小米, age=15], User [id=5, name=小海, age=15], User [id=6, name=小天, age=15]]

原文连接：https://blog.csdn.net/qq_20303591/article/details/108646398