Press "Enter" to skip to content

Jewels and Stones-LeetCode#771

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:

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

Example 2:

Input: J = "z", S = "ZZ"
Output: 0


  • S and J will consist of letters and have length at most 50.
  • The characters in J are distinct.



public static int numJewelsInStones(String J, String S) {
    int result = 0;
    Set setJ = new HashSet();
    for (char j : J.toCharArray()) {
    for (char s : S.toCharArray()) {
        if (setJ.contains(s)) {

    return result;

Be First to Comment


电子邮件地址不会被公开。 必填项已用*标注