程序员面试金典：单词的频率

题目描述

设计一个方法，找出任意指定单词在一本书中的出现频率。

我的解题

借助map记录

class WordsFrequency {
public:
   WordsFrequency(vector<string>& book) {
       for(auto b: book)
       {
           if(bookRecord.count(b) >0) bookRecord[b]+=1;
           else bookRecord[b] = 1;
       }
   }
   
   int get(string word) {
       return bookRecord[word];
   }
   map<string, int>bookRecord;
};

/**
* Your WordsFrequency object will be instantiated and called as such:
* WordsFrequency* obj = new WordsFrequency(book);
* int param_1 = obj->get(word);
*/

执行用时 :1028 ms, 在所有 C++ 提交中击败了5.03%的用户
内存消耗 :93.8 MB, 在所有 C++ 提交中击败了100.00%的用户