771. Jewels and Stones

Problem Link

Description

---

You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.

Letters are case sensitive, so "a" is considered a different type of stone from "A".

 

Example 1:

Input: jewels = "aA", stones = "aAAbbbb"
Output: 3

Example 2:

Input: jewels = "z", stones = "ZZ"
Output: 0

 

Constraints:

• 1 <= jewels.length, stones.length <= 50
• jewels and stones consist of only English letters.
• All the characters of jewels are unique.

Solution

---

Python3

class Solution:
    def numJewelsInStones(self, J: str, S: str) -> int:
        
        return sum([i in J for i in S])

Python

class Solution(object):
    def numJewelsInStones(self, J, S):
        """
        :type J: str
        :type S: str
        :rtype: int
        """
        lst = []
        for i in J:
            lst.append(i)
        count=0
        
        for i in S:
            if i in lst:
                count+=1
        return count