Hash内存溢出问题


public class Student {

public Student(int id, String name) {
this.id = id;
this.name = name;
}

private int id;

private String name;

public int getId() {
return id;
}

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

public String getName() {
return name;
}

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

@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + id;
result = prime * result + ((name == null) ? 0 : name.hashCode());
return result;
}

@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Student other = (Student) obj;
if (id != other.id)
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}


}


===========================================

import java.util.HashSet;
import java.util.Set;

public class HashTest1 {

public static void main(String[] args) {

Set<Student> set = new HashSet<Student>();
Student s1 = new Student(1,"jzk");
Student s2 = new Student(2,"wyq");
Student s3 = new Student(3,"jd");
set.add(s1);
set.add(s2);
set.add(s3);

System.out.println(set.size());
s1.setName("jzk1");
set.remove(s1);

System.out.println(set.size());

}

}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值