ACM_Someone like you

/*
 字典樹學習：
 
 輸入n個單詞  舉出一個單詞出現的次數。
 
 10
 
 apple
 ppppp
 hello
 hello
 need
 bee
 bee
 none
 you
 apple
 
 
 need
 ==1
 ==Program ended with exit code: 0
 
 */
//
//  main.cpp
//  CPlusDemo
//
//  Created by HF on 2018/5/15.
//  Copyright ? 2018年 HF-Liqun. All rights reserved.
//

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using  namespace std;

#define MAX 26    //the total number of alphabet is 26, a...z

struct DicTrie{
    bool isTerminal;//是否是單詞結束標志
    int  count;     //當前字符串出現次數
    struct DicTrie *next[MAX ]; //每個節點 最多 有 MAX 個孩子節點 結構體嵌套
}   ;

DicTrie *root = NULL; // 根節點是一個空節點 特此聲明并賦值

int init()            //初始化鏈表,有對空間要求的 可選用該方法進行初始化
{
    root = new DicTrie;
    root->count = 0;
    for (int  i = 0; i < MAX; i ++) {
        root->next[i] = NULL; // 空節點
        root->isTerminal = false; //
    }
    return 0;
}

bool isFindTrie(char *targetString) //判斷是否能在字典樹中查到目標串
{
    int len = strlen(targetString);
    DicTrie *head = root;
    for (int i = 0; i < len; i ++) {
        int res = (int)(targetString[i] - 'a');//當前小寫字母對應數字
        if (head->next[res] == NULL) { //如果是空節點 則為否 結束查找
            return false;
        } else {//不為空 更新頭指針 以便繼續往下查找
            head = head->next[res];
        }
    }
    if (head->count > 0) {
        return true;
    }
    return false;
}

int findTrieCount(char *targetString) //判斷是否能在字典樹中查到目標串
{
    int len = strlen(targetString);
    DicTrie *head = root;
    for (int i = 0; i < len; i ++) {
        int res = (int)(targetString[i] - 'a');//當前小寫字母對應數字
        if (head->next[res] == NULL) { //如果是空節點 則為否 結束查找
            return false;
        } else {//不為空 更新頭指針 以便繼續往下查找
            head = head->next[res];
        }
    }
    return head->count;
}

int insertTrie(char *targetString)
{
    int len = strlen(targetString);
    DicTrie *head = root;
    for (int i = 0; i < len; i ++) {
        int res = (int)(targetString[i] - 'a');//當前小寫字母對應數字
        if (head->next[res] == NULL) { //如果是空節點
            head->next[res] = new DicTrie;//則插入新節點元素
            head = head->next[res]; //更新頭指針 并初始化
            head->count = 0;        //
            for (int j = 0; j < MAX; j ++) {
                head->next[j] = NULL;
                head->isTerminal = false;
            }
        } else {
            head = head->next[res];
        }
    }
    head->count ++;//每次插入一個，響應計數都增加1
    head->isTerminal = true;
    return head->count;
}

int deleteTrie(char *targetString)
{
    int len = strlen(targetString);
    DicTrie *head = root;
    for (int i = 0; i < len; i ++) {
        int res = (int)(targetString[i] - 'a');//當前小寫字母對應數字
        if (head->next[res] == NULL) { //如果是空節點 表示刪除的字符串不在字典中
            return 0;
        } else { //繼續查找
            head = head->next[res];
        }
    }
    head->count --;//每次刪除一個，響應計數都-1
    if (head->count <= 0) {
        head->count = 0;
        head->isTerminal = false;
    }
    return 0;
}

int main(int argc, const char * argv[]) {
    // insert code here...
    int n;
    char targetString[20];
    
    init();
    
    scanf("%d",&n); //n 組數據
    for (int i = 0; i < n; i ++) {
        scanf("%s",targetString);
        //字符串插入字典樹
        insertTrie(targetString);//插入方法
    }
    scanf("%s",targetString);
    printf("==%d\n",findTrieCount(targetString));//查找方法
    
    return 0;
}