PAT 甲级 1077 Kuchiguse

PAT 甲级 1077 Kuchiguse

这道题原来是这样做的呐~
呐呐~
真简单呐~

#include<bits/stdc++.h>
using namespace std;

int main()
{
    
    
#ifdef LOCAL
    freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);
#endif
    int n; cin >> n; cin.get();
    vector<string> str_set(n);
    int min_str_size = 9999;
    //reverse一下，后缀变成前缀更方便比较呐~
    for (int i = 0; i < n; ++i) {
    
    
        getline(cin, str_set[i]);
        reverse(str_set[i].begin(), str_set[i].end());
        if (str_set[i].size() < min_str_size) min_str_size = str_set[i].size();
    }
    string suffix;
    for (int i = 0; i < min_str_size; ++i) {
    
    
        char charactar = str_set[0][i];
        bool is_suffix_charartar = true;
        for (int j = 0; j < n; ++j) {
    
    
            if (str_set[j][i] != charactar) {
    
    
                is_suffix_charartar = false;
                break;
            }
        }
        if (is_suffix_charartar) suffix.push_back(charactar);
        else break;
    }
    reverse(suffix.begin(), suffix.end());
    if (suffix.size() == 0) cout << "nai";
    else cout << suffix;
}