Algortthm--Jewels and Stones
Map的应用
Jewels and Stones
Title Detail
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
2 Input: J = "aA", S = "aAAbbbb"
Output: 3
Example 2:
1
2 Input: J = "z", S = "ZZ"
Output: 0
Note:S and J will consist of letters and have length at most 50.
The characters in J are distinct.
思路
使用Java里面的 Map
。key键保存宝石类型,value键保存数量统计。
Algorithm
1 | class Solution { |
法2 正则表达式
1 | String a = "[^"+J+"]"; |
Python方法
1 | return sum(S.count(i) for i in J) |
本博客所有文章除特别声明外,均采用 CC BY-NC-SA 4.0 许可协议。转载请注明来自 孙云增的博客!
评论