You're given strings `jewels` representing the types of stones that are jewels, and `stones` representing the stones you have. Each character in `stones` is a type of stone you have. You want to know how many of the stones you have are also jewels.
Letters are case sensitive, so `"a"` is considered a different type of stone from `"A"`.
Example 1
Input:jewels = "aA", stones = "aAAbbbb"
Output:3
Explanation:The stones "a", "A", and "A" are jewels.
Example 2
Input:jewels = "z", stones = "ZZ"
Output:0
Explanation:Case matters - 'Z' is not 'z'.
Example 3
Input:jewels = "abc", stones = "aabbcc"
Output:6
Constraints
- 1 <= jewels.length, stones.length <= 50
- jewels and stones consist of only English letters.
- All the characters of jewels are unique.