LeetCode - Jewels and Stones Java Solution - The Coding Shala

Home >> LeetCode >> Jewels and Stones

LeetCode - Jewels and Stones Java Solution

In this post, we will see leetcode jewels and stones problem's solution in Java.

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

Solve Problem Here: Click Here

Jewels and Stones problem java program

Approach 1:
We can use Set to store character and then we match with stones.
Java Program: 
class Solution {
    public int numJewelsInStones(String J, String S) {
        Set<Character> set = new HashSet<Character>();
        for(int i=0; i<J.length();i++) set.add(J.charAt(i));
        int cnt = 0;
        for(int i=0;i<S.length();i++){
            char ch = S.charAt(i);
            if(set.contains(ch)) cnt++;
        }
        return cnt;
    }
}

Approach 2:
Using indexOf().
Java Program: 

class Solution {
    public int numJewelsInStones(String J, String S) {
        int cnt = 0;
        for(char ch : S.toCharArray()){
            if(J.indexOf(ch) != -1) cnt++;
        }
        return cnt;
    }
}


Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.

Comments

Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Shell Script to Create a Simple Calculator - The Coding Shala

Richest Customer Wealth LeetCode Solution - The Coding Shala

New Year Chaos Solution - The Coding Shala

Add two numbers in Scala - The Coding Shala