#include<iostream>
#include<map>
#include<functional>
#include<utility>
using namespace std;
int Binary_search(int a[],int num,int key)
{
if (a==NULL || num<=0)
return -1;
int i=0,j=num-1;
int mid;
while(i<=j)
{
mid = (i+j)/2;
if(a[mid]==key)
return mid;
if(a[mid]<key)
i=mid+1;
if(a[mid]>key)
j=mid-1;
}
return -1;
}
void find_char(char str[])
{
if (str==NULL)
return ;
int leng=strlen(str);
int a[257]={0};
int num;
for(int i=0;i<leng;i++)
{
num=str[i]-0;
if(a[num]==0)
a[num]++;
else{
cout<<"首先出现两次的字符:"<<str[i]<<endl;
return;
}
}
}
int match(char *s,char *p="your")
{
if(s==NULL || s=="")
return 0;
int i=0,j=0;
int count=0;
while(s[i]!='\0')
{
if(s[i]==p[j] || s[i]==p[j]-32)
++j;
else
j=0;
if(p[j]=='\0')
{
++count;
j=0;
}
++i;
}
return count;
}
int main()
{
cout<<"第一题:"<<endl;
int a[]={1,3,4,6,8,9,11};
int key=4;
cout<<Binary_search(a,7,key)<<endl;
cout<<endl;
cout<<"第二题:"<<endl;
char str[]="qywyer23tdd";
find_char(str);
cout<<endl;
cout<<"第三题:"<<endl;
char *array[]={"Make yourself at home"
,"None of your business"
,"I will be more careful"
,"How about going to a move?"
,"Your life is your own affair"
,0};
typedef multimap<int,char *> mymap;
mymap mp;
for(int i=0;array[i]!=0;++i)
mp.insert(make_pair(match(array[i]),array[i]));
for(mymap::reverse_iterator it=mp.rbegin();it!=mp.rend();++it)
if((*it).first!=0)
cout<<it->first<<" "<<it->second<<endl;
return 0;
}
去哪儿网C++笔试题--二分查找、最先出现两次的字符、每个字符串中的单词个数
最新推荐文章于 2020-09-25 22:32:53 发布