leetcode 771 jewels and stones

LeetCode 771. Jewels and Stones

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:

1 2 3

> Input: J = "aA", S = "aAAbbbb" > Output: 3 >

Example 2:

1 2 3

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

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

int numJewelsInStones(std::string J, std::string S)
{
    int cnt = 0;
    for (auto i = 0; i < S.length(); i++)
    {
        /* 
        ** 查找J字符串中存不存在当前的S[i]的字符
        ** 若存在则统计加一，断开循环进入下一个S[i]
        */
        for (auto j = 0; j < J.length(); j++)
        {
            if (J[j] == S[i])
            {
                cnt++;
                break;
            }
        }
    }
    return cnt;
}