290. Word Pattern ——字符串的使用
Difficulty: Easy
给定一个pattern和一个字符串str,确定str是否遵循该种模式。(双向映射)
Given a pattern and a string str, find if str follows the same
pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
Examples: pattern = “abba”, str = “dog cat cat dog” should return true. pattern = “abba”, str = “dog cat cat fish” should return false.
pattern = “aaaa”, str = “dog cat cat dog” should return false. pattern = “abba”, str = “dog dog dog dog” should return false.
Notes: You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.
bool wordPattern(char* pattern, char* str) {
int i,j;
int len1=strlen(pattern);
int len2=strlen(str);
int strnum; //空格数
int leni,lenj;
int *sign,*strOffset;
char lable[2];
lable[1]=0;
strOffset=(int*)malloc((len1+1)*sizeof(int));
strnum=0;
strOffset[0]=0;
for(i=0;i<len2;i++)
{
lable[0]=*(str+i);
//if(lable[0]==' ')
if(strcmp(lable," ") == 0 ) //字符串str遇到空格,记录第一个字符串结束位置
{
strnum++;
strOffset[strnum]=i+1;
}
}
if(len1 != (strnum+1)) //pattern与str个数不匹配
{
free(strOffset);
return false;
}
strOffset[strnum+1]=len2+1; //增加一位用来确定最后一个字符串的长度
sign=(int*)malloc(len1*sizeof(int));
memset(sign,0,len1*sizeof(int));
for(i=0;i<len1-1;i++)
{
for(j=i+1;j<len1;j++)
{
if(sign[i]) //sign[i]==1说明第i个字符串与前面的字符串相等,已经比较过,可跳过后续字符串与该字符串的比较
break;
leni=strOffset[i+1]-strOffset[i]-1; //两字符串的长度
lenj=strOffset[j+1]-strOffset[j]-1;
if(pattern[i]==pattern[j])
{
int maxlen;
if(leni>lenj)
maxlen=leni;
else
maxlen=lenj;
sign[j]=1; //第j个字符串与前面的字符串相等,标志为1
if (strncmp(str+strOffset[i],str+strOffset[j],maxlen) != 0 ) //字符串不相等
{
free(sign);
free(strOffset);
return false;
}
}
else
{
if ( leni==lenj && strncmp(str+strOffset[i],str+strOffset[j],leni) == 0 ) //字符串字符数相等且leni个字符相等,则两字符串相等
{
free(sign);
free(strOffset);
return false;
}
}
}
}
return true;
}
要点:
1,寻找字符串中空格的方法:
(1)
char lable[2];
lable[1]=0; //作为字符串结束符
lable[0]=*(str+i);
if(strcmp(lable," ")==0) //字符串比较
// 找到空格
strcmp(lable,” “) 字符串比较函数,lable要为完整的字符串,相等则为0。
(2)
char la=*(str+i);
if(la==' ') //字符比较
//找到空格
空格’ ‘的ASCII码为32,结束符’\0’的ASCII码为0,空格不是结束符。
2,strncmp(str1,str2,count)比较字符串的前count个字节的内容
3,数组清零时size=len*sizeof(类型)