leetcode 771: Jewels and Stones

最新推荐文章于 2020-12-27 23:49:46 发布

thyme_C

最新推荐文章于 2020-12-27 23:49:46 发布

阅读量208

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode by python

本文链接：https://blog.youkuaiyun.com/thyme_C/article/details/83748297

leetcode by python 专栏收录该内容

10 篇文章

订阅专栏

本文解析了一道算法题目，任务是计算给定字符串中属于特定类型宝石的石头数量。通过遍历每种类型的宝石，并在石头字符串中计算其出现次数，最终返回总和。示例展示了输入和输出，代码实现简洁明了。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

You're given strings J representing the types of stones that are jewels, and Srepresenting 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.

解答：

class Solution:
    def numJewelsInStones(self, J, S):
        """
        :type J: str
        :type S: str
        :rtype: int
        """
        num = 0
        for i in J:
            num += S.count(i)
        return num