cpp-codes/Trie_recursive.cpp at master · sopneshgandhi/cpp-codes · GitHub

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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

struct t{
   t* character[26];
    bool last_node;

    t()
    {
        for(int i=0;i<26;i++)
        character[i]=NULL;
        last_node=false;

    }

};

 int count(t* temp) //to count the
 {
     int c=0;

     if(temp->last_node==true)
         c+=1;

     for(int i=0;i<26;i++)
     {
         if(temp->character[i]!=NULL)
         {
             c=c+count(temp->character[i]);
         }

     }

     return c;

 }

int main() {
    ios_base::sync_with_stdio(false);
    int n,q,i;
    cin>>n>>q;
    t* root = new t();
    t* temp = new t();
   string k;
    while(n--)  // take n strings as an input
    {
        temp=root;
        cin>>k;
        for(i=0;i<k.length();i++)
        {
            if(temp->character[k[i]-'a']==NULL )
               temp->character[k[i]-'a'] = new t();
            temp=temp->character[k[i]-'a'];
            if(i==k.length()-1)
                temp->last_node=true;

        }


    }
    int c;

    while(q--)  //for each query determine it is prefix of how  many strigs
    {
        temp=root;
        c=0;
        cin>>k;
        for(i=0;i<k.length();i++)
        {
            if(temp->character[k[i]-'a']!=NULL)
            {

                temp=temp->character[k[i]-'a'];
            }
            else
                break;

        }
        if(i==k.length()) //if query string matches the string
        {
            c=count(temp);

        }
        cout<<c<<"\n";

    }


    return 0;
}