描述
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
are guaranteed distinct, and all characters in J
and S
are letters. Letters are case sensitive, so "a"
is considered a different type of stone from "A"
.
Example 1:
1 | Input: J = "aA", S = "aAAbbbb" |
Example 2:
1 | Input: J = "z", S = "ZZ" |
Note:
S
andJ
will consist of letters and have length at most 50.- The characters in
J
are distinct.
分析
J 作为一个集合,遍历 S,判断是否在 J 中,就像查询哈希列表一样,统计一下即可。
解决方案1(Java)
1 | class Solution { |