[LeetCode] 771. Jewels and Stones

最新推荐文章于 2023-09-14 23:23:26 发布

笨笨De蜗牛

最新推荐文章于 2023-09-14 23:23:26 发布

阅读量151

点赞数

CC 4.0 BY-SA版权

分类专栏： LEETCODE 笔试编程题

本文链接：https://blog.youkuaiyun.com/a342500329a/article/details/79416079

LEETCODE 同时被 2 个专栏收录

155 篇文章

订阅专栏

笔试编程题

21 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定的石头中宝石的数量。输入包括两类字符串：一类代表宝石(J)，另一类代表所有拥有的石头(S)。通过遍历所有石头并统计其中属于宝石的类型数量来得出结果。

摘要生成于 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".

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 {
public:

    int numJewelsInStones(string J, string S) {
        int a[255];
        memset(a,0,sizeof(a));
        for(int i=0;i<S.length();i++){
            a[S[i]]++;
        }
        int ans=0;
        for(int i=0;i<J.length();i++){
            ans+=a[J[i]];
        }
        return ans;
    }
};