-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJewelsStones.java
42 lines (33 loc) · 925 Bytes
/
JewelsStones.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
37
38
39
40
41
42
package techQuestions;
/*
Purpose: 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.
Author: Erich Meissner
Date: 5/2/2020
Time: 10:12 PM
*/
import java.util.HashSet;
import java.util.Set;
public class JewelsStones {
public static void main(String[] args) {
String J = "z";
String S = "ZZ";
System.out.println(numJewelsInStones(J, S));
}
public static int numJewelsInStones(String J, String S) {
Set<Character> set = new HashSet<Character>();
for (char c: J.toCharArray()) {
set.add(c);
}
int count = 0;
for (char c: S.toCharArray()) {
if (set.contains(c)) {
count++;
}
}
return count;
}
}