You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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:
Input: J = "aA", S = "aAAbbbb"
Output: 3
*/
import java.util.HashSet;
import java.util.Set;
import java.util.stream.Collectors;
class Solution {
public int numJewelsInStones(String J, String S) {
Set<Integer> jewels = new HashSet<>(J.chars().boxed().collect(Collectors.toList()));