/*
class Solution {
public:
int numJewelsInStones(string J, string S) {
int ans = 0;
unordered_set<char> s;
for(auto m:J){
s.insert(m);
}
for(auto n:S)
{
if(s.count(n)) ans++;
}
return ans;
}
};
*/
class Solution {
public:
int numJewelsInStones(string J, string S) {
int ans = 0;
unordered_set<char> st;
for (auto c : J)
st.insert(c);
for (auto ch : S)
if (st.count(ch)) ans++;
return ans;
}
};
771. Jewels and Stones
最新推荐文章于 2020-12-27 23:49:46 发布