A HashMap cannot have multiple elements with the same key. Try using an ArrayList instead:
public class Item implements Comparable<Item>{
private int num;
private String name;
public Item(int num, String name) {
this.setNum(num);
this.setName(name);
}
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
@Override
public String toString() {
return "Item [num=" + num + ", name=" + name + "]";
}
@Override
public int compareTo(Item other) {
return this.num-other.num;
}
}
List<Item> list=new ArrayList<>();
list.add(new Item(3,"aba"));
list.add(new Item(4,"abab"));
list.add(new Item(3,"aba"));
list.add(new Item(3,"aba"));
Collections.sort(list);
System.out.println(list.toString());
Output:
[Item [num=3, name=aba], Item [num=3, name=aba], Item [num=3, name=aba], Item [num=4, name=abab]]
Map<Integer, List<String>>for example... How does your desired result look?Mapis to keep pairs of keys and values. If you need multiple values per key, your map entry has to contain aCollection<V>as its value.aba aba aba ababbut i need to sort the keysort.