https://leetcode.com/problems/jewels-and-stones/description/
题解:给出两个字符串,返回在字符串S中包含有字符串中的J的字母的个数是多少。
class Solution {
public int numJewelsInStones(String J, String S) {
int count = 0;
for(int i = S.length()-1; i >= 0; i--)
for(int j = J.length()-1; j >= 0; j--)
if(S.charAt(i) == J.charAt(j)) {
count++;
break;
}
return count;
}
}