Dig*_*ale 5 java sorting maps treemap
好吧,我有这个包含playerID和玩家averageScore的树形图.我想把它分成另外两张地图,这样每支球队都有一定数量的球员,整体球员得分大致相同(偏差约为+/- 2)
private TreeMap<Integer, Double> teamScoreMap = new TreeMap<>();
private TreeMap<Integer, Double> team1 = new TreeMap<>();
private TreeMap<Integer, Double> team2 = new TreeMap<>();
public void createTeam()
{
teamScoreMap.put(001, 5.0);
teamScoreMap.put(002, 8.4);
teamScoreMap.put(003, 2.1);
teamScoreMap.put(004, 6.5);
teamScoreMap.put(005, 4.5);
teamScoreMap.put(006, 3.2);
teamScoreMap.put(007, 9.8);
teamScoreMap.put(008, 7.6);
}
Run Code Online (Sandbox Code Playgroud)
试试这个
TreeMap<Integer,Double> teamScoreMap = new TreeMap<Integer, Integer>(bigMap);
int size = teamScoreMap.size();
SortedMap<Integer, Double> team1 = teamScoreMap .subMap(0, size/2);
SortedMap<Integer, Double> team2 = teamScoreMap .subMap((size/2)+1,size);
Run Code Online (Sandbox Code Playgroud)
没有理由实际转换为 TreeMap,因为它不提供比 SortedMap 所做的任何附加功能。
| 归档时间: |
|
| 查看次数: |
643 次 |
| 最近记录: |