Java List中数据的去重

public class Test {
  public static void main(String[] args) {
    List list = new ArrayList();
    list.add(11);
    list.add(12);
    list.add(13);
    list.add(14);
    list.add(15);
    list.add(11);
    System.out.println(list);
    Set set = new HashSet();
    List newList = new ArrayList();
    set.addAll(list);
    newList.addAll(set);
    System.out.println(newList);
  }
}

public class People {
  private String name;
  private String phoneNumber;
  public String getName() {
    return name;
  }
  public void setName(String name) {
    this.name = name;
  }
  public String getPhoneNumber() {
    return phoneNumber;
  }
  public void setPhoneNumber(String phoneNumber) {
    this.phoneNumber = phoneNumber;
  }
  public People(String name, String phoneNumber) {
    super();
    this.name = name;
    this.phoneNumber = phoneNumber;
}
  @Override
  public String toString() {
    return "People{" +
        "name='" + name + ''' +
        ", phoneNumber='" + phoneNumber + ''' +
        '}';
  }
  @Override
  public boolean equals(Object o) {
    People p = (People) o;
    return name.equals(p.name) && phoneNumber.equals(p.phoneNumber);
  }
  @Override
  public int hashCode() {
    String str = name + phoneNumber;
    return str.hashCode();
  }
}
public static void main(String[] args) {
  List<People> listPeople = new ArrayList<People>();
  listPeople.add(new People("张三", "11111"));
  listPeople.add(new People("张三", "22222"));
  listPeople.add(new People("李四", "33333"));
  listPeople.add(new People("张三", "22222"));
  Set<People> setData = new HashSet<People>();
  setData.addAll(listPeople);
  System.out.println("list：" + listPeople.toString());
  System.out.println("set：" + setData.toString());
}

  public boolean equals(Object anObject) {
    if (this == anObject) {
      return true;
    }
    if (anObject instanceof String) {
      String anotherString = (String)anObject;
      int n = count;
      if (n == anotherString.count) {
        char v1[] = value;
        char v2[] = anotherString.value;
        int i = offset;
        int j = anotherString.offset;
        while (n-- != 0) {
          if (v1[i++] != v2[j++])
            return false;
        }
        return true;
      }
    }
    return false;
  }

  public int hashCode() {
    int h = hash;
    if (h == 0 && count > 0) {
      int off = offset;
      char val[] = value;
      int len = count;
      for (int i = 0; i < len; i++) {
        h = 31*h + val[off++];
      }
      hash = h;
    }
    return h;
  }