时间复杂度(O( n))
class Solution {
public:
int numJewelsInStones(string J, string S) {
vector<int> vec(128,-1);
for(auto j:J) vec[j]=0;
int count=0;
for(auto s:S) if(vec[s]!=-1) count+=1;
return count;
}
};