题解 | #蓝廋、香菇#

就很简单，简单记录一下。

#include <iostream>
#include <unordered_map>
#include <string>

class MySolution{
public:
    std::string answer(std::string word){
        return this->wordMap[word];
    }
    
private:
    std::unordered_map<std::string,std::string> wordMap=
    {{"lansou","xianggu"},
     {"xianggu","lansou"}};
};

int main(){
    int n;
    MySolution *solution=new MySolution();
    std::cin>>n;
    while(n--){
        std::string aWord;
        std::cin>>aWord;
        std::string answer=solution->answer(aWord);
        std::cout<<answer<<std::endl;
        aWord.clear();
    }
    return 0;
}