[leetcode] problem 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

No.1

No.2

Note

Code

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

public int (String J, String S) {
    int result = 0;
    Set set = new HashSet();

    for (char j : J.toCharArray()) {
        set.add(j);
    }

    for (char s : S.toCharArray()) {
        if (set.contains(s)) {
            result++;
        }
    }
    
    return result;
}