描述

给定字符串J代表是珠宝的石头类型，而S代表你拥有的石头.S中的每个字符都是你拥有的一个石头. 你想知道你的石头有多少是珠宝.

J中的字母一定不同，J和S中的字符都是字母。 字母区分大小写，因此"a"和"A"是不同的类型.

• S和J由字母组成且长度最大为50.
• J中字符各不相同.
  
  您在真实的面试中是否遇到过这个题？

样例

样例 1:

输入: J = "aA", S = "aAAbbbb"

输出: 3

样例 2:

输入: J = "z", S = "ZZ"

输出: 0

Description

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 and J will consist of letters and have length at most 50.

The characters in J are distinct.

public class Solution {

    /**

     * @param J: the types of stones that are jewels

     * @param S: representing the stones you have

     * @return: how many of the stones you have are also jewels

     */

    public int numJewelsInStones(String J, String S) {

        // Write your code here

        char[] jewelry = J.toCharArray();

        char[] stone = S.toCharArray();

        int res = 0;

        for(int i=0; i<jewelry.length; i++){

            for(int j=0; j<stone.length; j++){

                if (jewelry[i] == stone[j]) {

                    res++;

                }

            }

        }

        return res;

    }

}