View difference between Paste ID: R0Veq606 and YuX0HQTK
SHOW: | | - or go back to the newest paste.
1
import java.util.LinkedHashMap;
2
import java.util.Map;
3
import java.util.Scanner;
4
5
public class SoftUniParking {
6
    public static void main(String[] args) {
7
        Scanner scanner = new Scanner(System.in);
8
9
        Map<String, String> parkingUsers = new LinkedHashMap<>();
10
        int numberCommand = Integer.parseInt(scanner.nextLine());
11
12
        for (int i = 0; i < numberCommand; i++) {
13
            String command = scanner.nextLine();
14
            String[] tokens = command.split(" ");
15
            String operation = tokens[0];
16
            String name = tokens[1];
17
18
            if (operation.equals("register")) {
19
                String plateNumber = tokens[2];
20
                if (!parkingUsers.containsKey(name)) {
21
                    parkingUsers.put(name, plateNumber);
22
                    System.out.printf("%s registered %s successfully%n", name, plateNumber);
23
                } else {
24
                    System.out.printf("ERROR: already registered with plate number %s%n", plateNumber);
25
                }
26
            } else if (operation.equals("unregister")) {
27
                if (!parkingUsers.containsKey(name)) {
28
                    System.out.printf("ERROR: user %s not found%n", name);
29
                } else {
30
                    parkingUsers.remove(name);
31
                    System.out.printf("%s unregistered successfully%n", name);
32
                }
33
            }
34
        }
35
36
        parkingUsers
37
                .forEach((key, value) -> System.out.println(String.format("%s => %s", key, value)));
38
39
    }
40
}