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:
    def numJewelsInStones(self, J: str, S: str) -> int:
        cnt = 0
        for j in J:
            cnt+=S.count(j)
        return cnt

解2

class Solution:
    def numJewelsInStones(self, J: str, S: str) -> int:
        return sum(map(S.count, J))

评价

没意思的题目