leetcode -easy- 771. Jewels and Stones [Python]

本文介绍了一种算法,用于计算给定字符串S中有多少字符同时出现在另一字符串J中,这里J代表宝石类型,S代表拥有的石头。算法通过遍历S,检查每个元素是否在J中,若在则计数加一,最终返回计数值。

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

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”.

思路:遍历S,如果元素也在J中,计数加一:

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

Runtime: 12 ms, faster than 94.14% of Python online submissions for Jewels and Stones.
Memory Usage: 11.6 MB, less than 94.62% of Python online submissions for Jewels and Stones.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值