62,612
社区成员
发帖
与我相关
我的任务
分享
package com.set.sort;
import java.util.Comparator;
public class User implements Comparator<User> {
// fields
private String uid;
private String name;
private Integer age;
// constructor using fields
public User(String uid, String name, Integer age) {
super();
this.uid = uid;
this.name = name;
this.age = age;
}
// getter and setter method
public String getUid() {
return uid;
}
public void setUid(String uid) {
this.uid = uid;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Integer getAge() {
return age;
}
public void setAge(Integer age) {
this.age = age;
}
@Override
public String toString() {
return "User [ uid=" + uid + ", name=" + name + ", age=" + age + " ]";
}
@Override
public int compare(User o1, User o2) {
return o1.getUid().compareTo(o2.getUid()); // 通过用户的ID进行升序排序
}
}
POJO类 User2.java
package com.set.sort;
public class User2 {
// fields
private String uid;
private String name;
private Integer age;
// constructor using fields
public User2(String uid, String name, Integer age) {
super();
this.uid = uid;
this.name = name;
this.age = age;
}
// getter and setter method
public String getUid() {
return uid;
}
public void setUid(String uid) {
this.uid = uid;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Integer getAge() {
return age;
}
public void setAge(Integer age) {
this.age = age;
}
@Override
public String toString() {
return "User [ uid=" + uid + ", name=" + name + ", age=" + age + " ]";
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((uid == null) ? 0 : uid.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;
User2 other = (User2) obj;
if (uid == null) {
if (other.uid != null)
return false;
} else if (!uid.equals(other.uid))
return false;
return true;
}
}
比较规则类:InvertedComparetor .java
package com.set.sort;
import java.util.Comparator;
public class InvertedComparetor implements Comparator<String> {
@Override
public int compare(String o1, String o2) {
return o2.compareTo(o1); //降序排列
}
}