LeetCode

#include<iostream>
#include<string>
using namespace std;
/*
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

Note:

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

int numJewelsInStones(string J, string S) ;

int main(void)
{
string J = "aA";
string S = "aAAbbbb";
cout<<(numJewelsInStones(J,S))<<endl;

return 0;
}


int numJewelsInStones(string J, string S) {
 int count=0;
   for(int i=0;S[i]!='\0';i++)
    for(int k=0;J[k]!='\0';k++)
      if (S[i]==J[k])
      {
       count++;
       break;
      }
    return count;
   }