int numJewelsInStones(char * J, char * S){
int i, j, count=0;
for(i=0; i<strlen(J); i++)
for(j=0; j<strlen(S); j++)
if(J[i] == S[j])
count++;
return count;
}
leetcode 771.宝石与石头
最新推荐文章于 2024-09-20 15:28:15 发布
int numJewelsInStones(char * J, char * S){
int i, j, count=0;
for(i=0; i<strlen(J); i++)
for(j=0; j<strlen(S); j++)
if(J[i] == S[j])
count++;
return count;
}