hihocoder 1014

http://hihocoder.com/problemset/problem/1014

构建一棵字典树，然后进行字符串匹配就可以了

这个题我本来是想用java做，但是做了后才发现有那么多的错误，java还是有待加强啊

两份代码都基本是一样的，只不过语法规则的区别

1014	Trie树	AC	G++	1788ms	114MB
1014	Trie树	AC	Java	9548ms	102MB

import java.util.Scanner;

    class Node {
        int[] next = new int[26];;
        int cnt = 0;;
        void inti() {
            for (int i = 0; i < 26; i++)
                next[i] = -1;
        }
    }

public class Main {

    private static Node[] node = new Node[1000005];
    static int cnt;
    public static void main(String[] args) {
        int a, b;
        Scanner cin = new Scanner(System.in);
        while (cin.hasNext()) {
            cnt = 1;
            a = cin.nextInt();
            String str;
             node[0] = new Node();
             node[0].inti();
            for (int i = 0; i < a; i++) {
                str = cin.next();
                insert(str);
            }
            b = cin.nextInt();
            for (int i = 0; i < b; i++) {
                str = cin.next();
                Find(str);
            }
        }
    }

    static void insert(String s) {
        int p = 0;
        for (int i = 0; i < s.length(); i++) {
            int tmp = s.charAt(i) - 'a';
            if (node[p].next[tmp] == -1) {
                 if(node[cnt]==null){
                      node[cnt] = new Node();
                      node[cnt].inti();
                 }
                 node[p].next[tmp] = cnt++;
            }
            p = node[p].next[tmp];
             if(node[p]==null){
                 node[p] = new Node();
                 node[p].inti();
             }     
            node[p].cnt++;
        }
    }

    static void Find(String s) {
        int p = 0;
        for (int i = 0; i < s.length(); i++) {
            int tmp = s.charAt(i) - 'a';
            if (node[p].next[tmp] == -1) {
                System.out.println("0");
                return;
            }
            p = node[p].next[tmp];
        }
        System.out.println(node[p].cnt);
    }
}

#include <iostream>
#include <string>
using namespace std;


class Node {
public :
    int next[26];
    int cnt = 0;
    void inti() {
        for (int i = 0; i < 26; i++)
            next[i] = -1;
    }
};
Node node[1000005];
int cnt;
void insert(string s) {
    int p = 0;
    for (int i = 0; i < s.length(); i++) {
        int tmp = s[i] - 'a';
        if (node[p].next[tmp] == -1) {
            node[cnt].inti();
            node[p].next[tmp] = cnt++;
        }
        p = node[p].next[tmp];
        node[p].cnt++;
    }
}

void Find(string s) {
    int p = 0;
    for (int i = 0; i < s.length(); i++) {
        int tmp = s[i] - 'a';
        if (node[p].next[tmp] == -1) {
            cout << "0" << endl;
            return;
        }
        p = node[p].next[tmp];
    }
    cout << node[p].cnt << endl;
}
int main() {
    int a, b;
    cnt = 1;
    cin >> a;
    string str;
    node[0].inti();
    for (int i = 0; i < a; i++) {
        cin >> str;
        insert(str);
    }
    cin >> b;
    for (int i = 0; i < b; i++) {
        cin >> str;
        Find(str);
    }
}