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 ar

test.cpp

//使用哈希法，用数组提前记录所有值，然后再进行遍历
class Solution {
public:
    int numJewelsInStones(string J, string S) {
        int array[100] = {0};
        int temp = 0;
        for(int i = 0;i < S.length();i++){
            array[S[i] - 65]++;
        }
        for(int i = 0;i < J.length();i++){
            temp += array[J[i] - 65];
        }
        
        return temp;
    }
};