Huawei_test_1.jpg

    • 字符串筛选
    • 字符串截取
    • 字符串计数

    • 去重排序

      1. #include <iostream>
      2. #include <vector>
      3. #include <string>
      4. #include <algorithm>
      5. using namespace std;
      6. int main() {
      7.   string Input_str;
      8.   while (cin >> Input_str)
      9.   {
      10.       vector<string> name_vec;
      11.       vector<string> name_list;
      12.       string temp;
      13.       int num[100] = { 0 };
      14.       int res_error = 0;
      16.       for (int i = 0; i < Input_str.size(); i++) {
      17.           //find the illegal sign if happens change the flag
      18.           if ((Input_str[i]<'A' || (Input_str[i] > 'Z'&&Input_str[i] < 'a') || Input_str[i]>'z') && Input_str[i] != ',') {
      19.               res_error = 1;
      20.               break;
      21.           }
      23.           //Use comma as flag to split the string
      24.           if (Input_str[i] != ',')
      25.               temp += Input_str[i];
      26.           else {
      27.               name_vec.push_back(temp);
      28.               temp.clear();
      29.           }
      30.       }
      31.       //deal with the last one without comma
      32.       name_vec.push_back(temp);
      34.       //sort the list of name
      35.       name_list = name_vec;
      36.       sort(name_list.begin(), name_list.end());
      37.       name_list.erase(unique(name_list.begin(), name_list.end()), name_list.end());
      39.       //calculate the number of the name
      40.       for (int i = 0; i < name_vec.size(); i++)
      41.           for (int j = 0; j < name_list.size(); j++)
      42.               if (name_vec[i] == name_list[j]) {
      43.                   num[j]++;
      44.                   break;
      45.               }
      47.       //fine the most one 
      48.       int max = 0;
      49.       for (int i = 0; i < 99; i++)
      50.           if (num[i] > max)
      51.               max = num[i];              //there is an error in the test
      53.       //pick the most ticket' owner 
      54.       vector<string> equal_name;
      55.       for (int i = 0; i < name_list.size(); i++)
      56.           if (num[i] == max)
      57.               equal_name.push_back(name_list[i]);
      59.       //sort again
      60.       sort(equal_name.begin(), equal_name.end());
      62.       if (res_error == 1) {
      63.           cout << "error.0001" << endl;
      64.           continue;
      65.       }
      67.       cout << equal_name[0] << endl;
      68.   }
      69. }