算法：C++实现电话号码分身

题目：首先将电话号码中的每个数字加上8取个位，然后使用对应的大写字母代替 （”ZERO”, “ONE”, “TWO”, “THREE”, “FOUR”, “FIVE”, “SIX”, “SEVEN”, “EIGHT”, “NINE”）， 然后随机打乱这些字母，所生成的字符串即为电话号码对应的分身。

思路：通过这些单词我们会发现有些字母只出现在特定的单词中，例如“Z”只出现在“ZERO”这个单词中，那么输入的字符串中包含的“Z”的数目实际上就转换后数字“0”的数目，类似的其他数字我们都可以通过找到专属字符或是通过已确定的数字准确的推算出来，然后我们就可以根据这些个特定的字符来推算对应的数字。

• 牛客上高人做法：链接

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>

void operMap(std::map<char, int> &index, std::string str, int num) {
    for (int i = 0; i < str.size(); i++) {
        index[str[i]] -= num;
    }
}
int main() {
    using namespace std;
    int t;
    cin >> t;
    while (t--) {
        string str;
        cin >> str;
        map<char, int> index;
        vector<int> arr(10, 0);
        for (int i = 0; i < str.size(); i++) {
            map<char, int>::iterator itor = index.find(str[i]);
            if (itor == index.end()) {
                index[str[i]] = 1;
            }
            else {
                index[str[i]]++;
            }
        }
        arr[2] = index['Z'];
        operMap(index, "ZERO", arr[2]);
        arr[4] = index['W'];
        operMap(index, "TWO", arr[4]);
        arr[6] = index['U'];
        operMap(index, "FOUR", arr[6]);
        arr[8] = index['X'];
        operMap(index, "SIX", arr[8]);
        arr[0] = index['G'];
        operMap(index, "EIGHT", arr[0]);
        arr[3] = index['O'];
        operMap(index, "ONE", arr[3]);
        arr[5] = index['R'];
        operMap(index, "THREE", arr[5]);
        arr[7] = index['F'];
        operMap(index, "FIVE", arr[7]);
        arr[9] = index['V'];
        operMap(index, "SEVEN", arr[9]);
        arr[1] = index['I'];
        operMap(index, "NINE", arr[1]);
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < arr[i]; j++) {
                cout << i;
            }
        }
        cout << endl;
    }
    return 0;
}

• 土著民做法（土了自然好理解）

#include<iostream>
#include<vector>
#include<algorithm>
int c2i(char c){
    switch(c){
        case 'Z':return 0;break;
        case 'W':return 2;break;
        case 'U':return 4;break;
        case 'X':return 6;break;
        case 'G':return 8;break;
        case 'H':return 3;break;
        case 'F':return 5;break;
        case 'S':return 7;break;
        case 'O':return 1;break;
        default:return 0;
    }
}
void transfer(std::vector<int>& vec){
    for(int i=0;i<vec.size();++i){
        vec[i]=(vec[i]+2)%10;
    }
}
void countNum(std::vector<int>&vec_c,std::vector<int>&vec_i,int & count){
    while(count>0){
        if(vec_c['Z'-'A']){
            vec_i.push_back(c2i('Z'));
            vec_c['Z'-'A']--;
            vec_c['E'-'A']--;
            vec_c['R'-'A']--;
            vec_c['O'-'A']--;
            count-=4;
        }
        else if(vec_c['W'-'A']){
           vec_i.push_back(c2i('W'));
            vec_c['W'-'A']--;
            vec_c['T'-'A']--;
            vec_c['O'-'A']--;
            count-=3;
        }
        else if(vec_c['U'-'A']){
            vec_i.push_back(c2i('U'));
            vec_c['F'-'A']--;
            vec_c['O'-'A']--;
            vec_c['U'-'A']--;
            vec_c['R'-'A']--;
            count-=4;
        }
        else if(vec_c['X'-'A']){
            vec_i.push_back(c2i('X'));
            vec_c['X'-'A']--;
            vec_c['S'-'A']--;
            vec_c['I'-'A']--;
            count-=3;
        }
        else if(vec_c['G'-'A']){
            vec_i.push_back(c2i('G'));
            vec_c['G'-'A']--;
            vec_c['E'-'A']--;
            vec_c['I'-'A']--;
            vec_c['H'-'A']--;
            vec_c['T'-'A']--;
            count-=5;
        }
        else if(vec_c['H'-'A']){
            vec_i.push_back(c2i('H'));
            vec_c['T'-'A']--;
            vec_c['H'-'A']--;
            vec_c['R'-'A']--;
            vec_c['E'-'A']--;
            vec_c['E'-'A']--;
            count-=5;
        }
        else if(vec_c['F'-'A']){
            vec_i.push_back(c2i('F'));
            vec_c['F'-'A']--;
            vec_c['I'-'A']--;
            vec_c['V'-'A']--;
            vec_c['E'-'A']--;
            count-=4;
        }
        else if(vec_c['S'-'A']){
            vec_i.push_back(c2i('S'));
            vec_c['S'-'A']--;
            vec_c['E'-'A']--;
            vec_c['V'-'A']--;
            vec_c['E'-'A']--;
            vec_c['N'-'A']--;
            count-=5;
        }
        else if(vec_c['O'-'A']){
            vec_i.push_back(c2i('O'));
            vec_c['O'-'A']--;
            vec_c['N'-'A']--;
            vec_c['E'-'A']--;
            count-=3;
        }
    }
}
int main(){
    int num;
    std::cin>>num;
    while(num--){
        std::string temp;
        std::vector<int> vec_c(26,0);
        std::vector<int> vec_i;
        int count=0;
        std::cin>>temp;
        for(int i=0;i<temp.length();++i){
            vec_c[temp[i]-'A']++;
            count++;
        }

        //计数
        countNum(vec_c,vec_i,count);
        transfer(vec_i);
        sort(vec_i.begin(),vec_i.end());
        for(auto c:vec_i){
            std::cout<<c;
        }
        std::cout<<std::endl;
        //输出

    }
    return 0;
}