LC 771. Jewels and Stones

1.题目

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 Sare 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.

2.代码

class Solution {
public:
    int numJewelsInStones(string J, string S) {
        int num =0;
        set<char>set;
        for(int i = 0;i<J.length();i++)
            set.insert(J[i]);
        for(int i = 0;i<S.length();i++) {
            if(set.count(S[i])) { num++; }//如果S中的字符在J中则num++
        }
        return num;
    }
};