package LeetCode;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

/**
 * Comparable 和 Comparator
 */
public class Person implements Comparable<Person> {
    private String name;
    private Integer age;
    private String gender;

    public Person() {
    }

    public Person(String name, Integer age, String gender) {
        this.name = name;
        this.age = age;
        this.gender = gender;
    }

    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;
    }

    public String getGender() {
        return gender;
    }

    public void setGender(String gender) {
        this.gender = gender;
    }

    @Override
    public String toString() {
        return "Person{" +
                "name='" + name + '\'' +
                ", age=" + age +
                ", gender='" + gender + '\'' +
                '}';
    }

    @Override
    public int compareTo(Person o) { //返回>0 则交换位置
        return o.getAge() - this.getAge();
    }

    public static void main(String[] args) {
        Person p1 = new Person("Tom", 10, "");
        Person p2 = new Person("Jack", 12, "");
        Person p3 = new Person("Sam", 15, "");
        ArrayList<Person> arr = new ArrayList<>();
        Collections.addAll(arr, p1, p2, p3);
        Collections.sort(arr, new Comparator<Person>() {
            @Override
            public int compare(Person o2, Person o1) {//返回>0 则交换位置   Comparator优先级大于Comparable
                return o1.getAge() - o2.getAge();
            }
        });
        System.out.println(arr.toString());
    }
}