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”.
思路:遍历S,如果元素也在J中,计数加一:
class Solution(object):
def numJewelsInStones(self, J, S):
"""
:type J: str
:type S: str
:rtype: int
"""
count = 0
for i in S:
if i in J:
count = count + 1
return count
Runtime: 12 ms, faster than 94.14% of Python online submissions for Jewels and Stones.
Memory Usage: 11.6 MB, less than 94.62% of Python online submissions for Jewels and Stones.