LeetCode-771-Jewels and Stones-E(字符串包含函数练习)

最新推荐文章于 2025-07-31 19:38:27 发布

文卿的藏剑山庄

最新推荐文章于 2025-07-31 19:38:27 发布

阅读量107

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签：字符串 java 算法

本文链接：https://blog.youkuaiyun.com/qq_37651325/article/details/108523418

leetcode 专栏收录该内容

142 篇文章

订阅专栏

本文介绍了一个算法问题，即计算给定字符串中属于特定类型字符（宝石）的数量。通过遍历和匹配的方式，实现了对输入字符串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”.

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 n=S.length();
        int total=0;
        for(int i=0;i<n;i++){
            if(J.contains(S.substring(i,i+1)))
                total++;
        }
        return total;
    }
}