不知道为什么用string,同样二分法就会错。
1)二分法,转别人AC代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
using namespace std;
const int Max=120010;
char word[Max][100];
int search(char *str,int n)
{
int left=0,right=n-1;
while(left<=right)
{
int mid=(left+right)>>1;
if(!strcmp(str,word[mid]))
return 1;
if(strcmp(str,word[mid])<0)
right=mid-1;
else
left=mid+1;
}
return 0;
}
int main()
{
int n=0;
while(scanf("%s",word[n++])!=EOF);
for(int i=0; i<n; i++)
{
int len=strlen(word[i]);
char str[100],*str1;
for(int j=0,k=0; j<len-1; j++)
{
str[k++]=word[i][j];
str[k]='\0';
str1=word[i]+j+1;
if(search(str,n)&&search(str1,n))
{
printf("%s\n",word[i]);
break;
}
}
}
return 0;
}
2)map容易过,因为map/set等容器内的数据结构采用红黑树,查找的实现方法就是二分法,所以直接用STL代码更简洁:
#include <bits/stdc++.h>
using namespace std;
map <string,int> hasn;
const int maxn=100010;
int main()
{
hasn.clear();
string a[maxn],b,c;
int g=0;
while(cin>>a[g]){
hasn[a[g]]=1;
g++;
}
for(int i=0;i<g;i++){
for(int j=0;j<a[i].size()-1;j++){
b="";
b=a[i].substr(0,j+1);
if(!hasn[b]) continue;
c="";
c=a[i].substr(j+1);
if(!hasn[c]) continue;
cout<<a[i]<<endl;
break;
}
}
return 0;
}