771. 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 in S 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"
Output: 3

Example 2:

Input: J = "z", S = "ZZ"
Output: 0

Note:

• S and J will consist of letters and have length at most 50.
• The characters in J are distinct.

题意：给出一个模式串J，问在串S中出现了多少个J中的字母。这里要区分大小写。

思路：哈希的思想，使用map记录下J中出现的字母。然后遍历S串即可。

class Solution {
public:
    int numJewelsInStones(string J, string S) {
        map<char,int>mp;
        for(int i=0;i<J.length();i++)
            mp[J[i]]++;
        int cnt=0;
        for(int i=0;i<S.length();i++){
            if(mp.count(S[i])!=0)
                cnt++;
        }
        return cnt;
    }
};