771. Jewels and Stones 珠宝和石头

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:

Input: J = "aA", S = "aAAbbbb"
Output: 3

Example 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.

1. class Solution:
2. def numJewelsInStones(self, J, S):
3. """
4. :type J: str
5. :type S: str
6. :rtype: int
7. """
8. res = 0
9. s = set([(i) for i in J])
10. for i in S:
11. if i in s:
12. res+=1
13. return res

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/xiejunzhao/p/8379840.html