Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package javabasics;
- import java.util.Collection;
- import java.util.HashMap;
- import java.util.LinkedHashMap;
- import java.util.Map;
- import java.util.Scanner;
- import java.util.Set;
- import java.util.TreeMap;
- public class UserLogs {
- public static void main(String[] args) {
- Scanner input = new Scanner(System.in);
- String current = input.nextLine();
- Map<String,LinkedHashMap<String,Integer>> info = new TreeMap<>();
- while (!current.equals("end")){
- String[] userInfo = current.split(" ");
- String address = userInfo[0].substring(3);
- String user = userInfo[2].substring(5);
- if (info.containsKey(user)){
- LinkedHashMap<String,Integer> old = info.get(user);
- if (old.containsKey(address)){
- int oldCount = old.get(address);
- old.put(address, oldCount+1);
- info.put(user, old);
- }
- else {
- old.put(address, 1);
- info.put(user, old);
- }
- }
- else {
- LinkedHashMap<String,Integer> newInfo = new LinkedHashMap<>();
- newInfo.put(address, 1);
- info.put(user, newInfo);
- }
- current = input.nextLine();
- }
- Set<String> keys = info.keySet();
- for(String key: keys){
- System.out.println(key+":");
- HashMap values = info.get(key);
- Set<String> keysVal = values.keySet();
- Collection valuesVal = values.values();
- int count = 0;
- for(String k: keysVal){
- System.out.print(k + " => " + values.get(k));
- count++;
- if (count == values.size()){
- System.out.println(".");
- }
- else {
- System.out.print(", ");
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment