You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.
Letters are case sensitive, so "a" is considered a different type of stone from "A".
Example 1:
Input: jewels = "aA", stones = "aAAbbbb" Output: 3
Example 2:
Input: jewels = "z", stones = "ZZ" Output: 0
Constraints:
1 <= jewels.length, stones.length <= 50jewels and stones consist of only English letters.jewels are unique.class Solution {
public:
int numJewelsInStones(string jewels, string stones) {
map <char, bool> m;
int res=0;
for (auto j:jewels)
m[j]=true;
for (auto s:stones)
if (m[s])
res++;
return res;
}
};class Solution {
public:
int numJewelsInStones(string jewels, string stones) {
map <char, int> m;
int res=0;
for (auto j:jewels)
m[j]=1;
for (auto s:stones)
if (m[s])
res++;
return res;
}
};