python leetcode 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 Sis 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".

你得到的字符串J代表的是宝石的类型，S代表你拥有的石头。 S中的每个角色都是你拥有的一种石头。 你想知道你有多少个石头是宝石。
J中的字母保证不同，J和S中的所有字符都是字母。 字母区分大小写，所以“a”被认为是与“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.

class Solution:
    def numJewelsInStones(self, J, S):
        """
        :type J: str
        :type S: str
        :rtype: int
        """
        ans = 0
        for i in range(len(S)):
            if S[i] in J:
                ans += 1
        return ans