Question

2. In developing software for a game, there is a need for a mapping to ’look up’ the team affiliation for a player, an affiliation which could change during the run-time of the game. Implement a method that does the following: (a) Create a Map data structure to hold the associations between player name (key) and team affiliation (value) (b) Add at least 5 mappings to the map (c) Print out the current roster of mappings (d) Assuming some time has passed, change some of the mappings to simulate the players changing their affiliations (e) Again, print out the current roster of mappings

Answer 1

import java.util.*;
public class Main
{
public static void main(String[] args) {
System.out.println("Initial Team affiliations of Player5 and Player1\n");

Map<String, String> teams = new HashMap<String, String>() {{
put("Player1", "TeamA");
put("Player2", "TeamB");
put("Player3", "TeamA");
put("Player4", "TeamC");
put("Player5", "TeamC");
}};

teams.entrySet().forEach(entry->{
System.out.println(entry.getKey() + " " + entry.getValue());  
});

System.out.println("Changing Team affiliations of Player5 and Player1\n");
teams.replace("Player5","TeamA");
teams.replace("Player1","TeamC");

teams.entrySet().forEach(entry->{
System.out.println(entry.getKey() + " " + entry.getValue());  
});

}
}

----------------------------------

Output:

Initial Team affiliations of Player5 and Player1

Player5 TeamC
Player2 TeamB
Player1 TeamA
Player4 TeamC
Player3 TeamA
Changing Team affiliations of Player5 and Player1

Player5 TeamA
Player2 TeamB
Player1 TeamC
Player4 TeamC
Player3 TeamA