C++小程序——Jewels and Stones（ 珠宝和石头）

Description

You're given strings J representing the types of stones that are jewels, and S representing the stones you have.  Each character in Sis 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.

Solution 1：

class Solution {
public:
	int numJewelsInStones(string J, string S) {
		int num = 0;	
		for (int i = 0; i<J.length();i++)
        {
            for (int k = 0; k<S.length(); k++)
            {
                    if (J[i] == S[k])
                            num++;
            }
        }
        return num;
	}
};

Solution 2：

class Solution {
public:
	int numJewelsInStones(string J, string S) {
		int res =0;
        set <char> setJ(J.begin(), J.end());
        for(char s : S)
        if(setJ.count(s)) 
            res++;
        return res; 
	}
};

Solution 3：

class Solution {
public:
	int numJewelsInStones(string J, string S) {
		unordered_set<char> jewels(std::begin(J), std::end(J));
        int res = 0;
        std::for_each(std::begin(S), std::end(S), [&res, &jewels](char ch) 
                      { res += jewels.count(ch); });
        return res;
	}
};