-
Notifications
You must be signed in to change notification settings - Fork 34
/
_771.java
executable file
·36 lines (34 loc) · 1.07 KB
/
_771.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
package com.hit.basmath.learn.hash_table;
import java.util.HashSet;
import java.util.Set;
/**
* 771. Jewels and Stones
* <p>
* 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.
* <p>
* 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".
* <p>
* Example 1:
* <p>
* Input: J = "aA", S = "aAAbbbb"
* Output: 3
* <p>
* Example 2:
* <p>
* Input: J = "z", S = "ZZ"
* Output: 0
* <p>
* Note:
* <p>
* S and J will consist of letters and have length at most 50.
* The characters in J are distinct.
*/
public class _771 {
public int numJewelsInStones(String J, String S) {
int res = 0;
Set setJ = new HashSet();
for (char j : J.toCharArray()) setJ.add(j);
for (char s : S.toCharArray()) if (setJ.contains(s)) res++;
return res;
}
}