Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Map;
- import java.util.Scanner;
- import java.util.TreeMap;
- public class Followers {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- Map<String, Integer> followers = new TreeMap<>();
- String input;
- while (!"Log out".equals(input = scanner.nextLine())) {
- String[] data = input.split(": ");
- String command = data[0];
- String username = data[1];
- switch (command) {
- case "New follower":
- if (!followers.containsKey(username)) {
- followers.put(username, 0);
- }
- break;
- case "Like":
- int countOfLikes = Integer.parseInt(data[2]);
- if (!followers.containsKey(username)) {
- followers.put(username, countOfLikes);
- } else {
- followers.put(username, followers.get(username) + countOfLikes);
- }
- break;
- case "Comment":
- if (!followers.containsKey(username)) {
- followers.put(username, 1);
- } else {
- followers.put(username, followers.get(username) + 1);
- }
- break;
- case "Blocked":
- if (followers.containsKey(username)) {
- followers.remove(username);
- } else {
- System.out.printf("%s doesn't exist.%n", username);
- }
- break;
- }
- }
- System.out.printf("%d followers%n", followers.size());
- followers.entrySet().stream()
- .sorted(Map.Entry.<String, Integer>comparingByValue()
- .reversed()
- .thenComparing(Map.Entry::getKey))
- .forEach(entry -> System.out.printf("%s: %d%n", entry.getKey(), entry.getValue()));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement