Jewels and Stones
You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character inS is a type of stone you have. You want to know how many of the stones you have are also jewels.
The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from "A".
Example 1:
Input: J = "aA", S = "aAAbbbb" |
Example 2:
Input: J = "z", S = "ZZ" |
代码
解法1：
class Solution {
public:
int numJewelsInStones(string J, string S) {
int nCount = ;
for(int i = ; i < J.length(); i++) {
for(int j = ; j < S.length(); j++) {
if(J[i] == S[j]) nCount++;
}
}
return nCount;
}
};
解法2：
class Solution {
public:
int numJewelsInStones(string J, string S) {
int res = ;
set<char> setJ(J.begin(), J.end());
for (char s : S) if (setJ.count(s)) res++;
return res;
}
};
地址：https://leetcode.com/problems/jewels-and-stones/description/