[EASY]771. Jewels and Stones

https://leetcode.com/problems/jewels-and-stones/

---

题目 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.

---

大意就是看看J中的字母在S中出现了多少次，J中不会出现相同字母，JS均为大小写敏感。python字符串有个count()函数可以直接数出来...没啥需要注意的

class Solution:
    def numJewelsInStones(self, J: str, S: str) -> int:
        num=0
        for i in range(len(J)):
            num=num+S.count(J[i])
        return num

string.count(str, beg=0, end=len(string))

返回 str 在 string 里面出现的次数，如果 beg 或者 end 指定则返回指定范围内 str 出现的次数