Day 2 Jewels and Stones.cpp

PROBLEM:

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


SOLUTION:


class Solution {
public:
    int numJewelsInStones(string J, string S) {
        
        unordered_set<char> s;
        int i,n,m,ans=0;
        
        m=J.length();
        n=S.length();
        
        for(i=0;i<m;i++)
            s.insert(J[i]);
        
        
        for(i=0;i<n;i++)
        {
            if(s.find(S[i])!=s.end())
            {
                ans++;
            }
        }
        
        return ans;
    }
};