[Offer收割]编程练习赛23 register

Ended

Participants:430

Verdict:Wrong Answer
Score:20 / 100
Submitted:2017-08-20 13:06:15

Lang:Java

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.LinkedList;
import java.util.Scanner;
import java.util.HashMap;
public class Main{
    static int n;
    static HashMap<String,Node>map=new HashMap<String,Node>();
    public static void main(String[]args){
        Scanner in=new Scanner(System.in);
        n=in.nextInt();
        in.nextLine();
        String[] data=new String[n];
        for(int i=0;i<n;i++)
        {
            data[i]=in.nextLine();
            makeTree(data[i]);
        }
        for(int i=0;i<n;i++)
        {
            printTree(data[i]);
        }
    }
    public static void makeTree(String str)
    {
        String[]temp=str.split("/");
        HashMap<String,Node>p=map;
        for(int i=1;i<temp.length;i++){
            if(p.containsKey(temp[i])){
                Node node=p.get(temp[i]);
                node.count++;
                p=node.map;
            }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX