这是第八章的第二个习题。这是细节上的问题, 想清楚不太难的。。。
#include <iostream>
#include <algorithm>
using namespace std;
string haha[1003];
int number;
string str,s;
char ans[100];
void work();
int main()
{
/*freopen("1610.in","r",stdin);
freopen("1610.out","w",stdout);*/
while(cin >> number) {
if(!number) break;
for(int o = 0;o<number;o++) cin >> haha[o];
sort(haha,haha+number);
work();
}
return 0;
}
void work(){
number>>=1;
number--;
int length_1 = haha[number].size(), length_2 = haha[number+1].size();
str = haha[number]; s = haha[number+1];
int length = min(length_1, length_2), p = 0, Sta = 0;
while(p < length) {
if(p == length_1-1) {
ans[p] = str[p];break;
}
if(str[p] != s[p]) {
if(s[p]-str[p]==1 && p==length_2-1) {
ans[p] = str[p]; p++; Sta = 1;
}else ans[p] = str[p]+1;
break;
}
ans[p] = str[p];p++;
}
if(Sta)
{
while(p<length_1) {
if(p == length_1-1) {
ans[p] = str[p];break;
}
if(str[p] == 'Z') {
ans[p] = 'Z'; p++;
}else {
ans[p] = str[p]+1;break;
}
}
}
for(int i=0; i <= p; i++) cout<<ans[i];
cout<<endl; return ;
}