List集合去重和自动排序

List集合和set集合对于自定义对象的去重是不一样的,这还是和底层结构相关。
hashset的去重就要重写hashcode和equals等等,今天先写一个list的,有问题欢迎交流,有错误理解欢迎指出。
package jiheTotal;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
import java.util.TreeSet;

/键盘录入5个学生信息(姓名,语文成绩,数学成绩,英语成绩),按照总分从高到低输出到控制台/
public class listStudent {
public static void main(String[] args) {
ArrayList lis = new ArrayList();
lis.add(new Student(“李子”,80,90,60,230));
lis.add(new Student(“小琥”,90,90,80,260));
lis.add(new Student(“小王”,90,80,80,250));
lis.add(new Student(“小月”,80,60,70,240));
lis.add(new Student(“小琥”,90,90,80,260));
lis.add(new Student(“李子”,70,90,80,240));

		ArrayList<Student> arr = getSingle(lis);
		// list的自定义类必须重写compareTo以及调用Collections方法才可以排序
		Collections.sort(lis);
	arr.forEach((Student student)->System.out.println(student));
}
public static ArrayList getSingle(ArrayList lis) {
	//新数组接收去重的集合
	ArrayList<Student> nelis = new ArrayList<>();
	Iterator<Student> ite= lis.iterator();	
	while(ite.hasNext()) {
	 Student st = ite.next();
	//底层源码还是 equals的比较,所以可以直接对比,比较的是值,而不是对象的地址,前提自定义类必须重写equals
	 	if(!nelis.contains(st)) {
	 			nelis.add(st);
	 	}
	}
	
	return nelis;
}

}

package jiheTotal;
import java.util.Collections;
/键盘录入5个学生信息(姓名,语文成绩,数学成绩,英语成绩),按照总分从高到低输出到控制台/
public class Student implements Comparable{// implements Comparable
String name;
int chineseScore;
int mathScore;
int englishScore;
int total;
public Student(String name, int chineseScore, int mathScore, int englishScore, int total) {
this.name=name;
this.chineseScore=chineseScore;
this.mathScore=mathScore;
this.englishScore=englishScore;
this.total=total;
}

	@Override
	public String toString() {
		return "Student [name=" + name + ", chineseScore=" + chineseScore + ", mathScore=" + mathScore
				+ ", englishScore=" + englishScore + ", total=" + total + "]";
	}
	
	public int getChineseScore() {
		return chineseScore;
	}
	public void setChineseScore(int chineseScore) {
		this.chineseScore = chineseScore;
	}

	@Override
	public boolean equals(Object obj) {
	**//hashcode和equals判断去重**
		Student stu =(Student)obj;
		return  this.getName().equals(stu.getName()) && this.getTotal()==stu.getTotal();		
	}

		@Override
	public int compareTo(Student o) {
		int result =total-o.total;
		if(result==0) {
			return name.compareTo(o.name);
		}
		return result;
	}
		
	public int getTotal() {
		return total;
	}
	public void setTotal(int total) {
		this.total = total;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}	

}

contain的源代码:
public boolean contains(Object o) {
return indexOf(o) >= 0;
}

public int indexOf(Object o) {
if (o == null) {
for (int i = 0; i < size; i++)
if (elementData[i]==null)
return i;
} else {
for (int i = 0; i < size; i++)
if (o.equals(elementData[i]))
return i;
}
return -1;
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值