leetcode

0 class Solution {

1 public:

2 int numJewelsInStones(const string &jewels, const string &stones) const {

3 static const auto convert = [](char c) { return isupper(c) ? c - 'A' : c - 'a' + 26; };

4

5 static int seen[52];

6 int res = 0;

7

8 memset(seen, 0x00, sizeof(seen));

9 for (const char c : jewels)

10 seen[convert(c)] = true;

11 for (const char c : stones)

12 res += seen[convert(c)];

13

14 return res;

15 }

16 };