771. Jewels and Stones leetcode solution in c++

 

You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.

Letters are case sensitive, so "a" is considered a different type of stone from "A".

 

Example 1:

Input: jewels = "aA", stones = "aAAbbbb"
Output: 3

Example 2:

Input: jewels = "z", stones = "ZZ"
Output: 0

 

Constraints:

• 1 <= jewels.length, stones.length <= 50
• jewels and stones consist of only English letters.
• All the characters of jewels are unique.

solution

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Jewels and Stones.

Memory Usage: 6.2 MB, less than 76.76% of C++ online submissions for Jewels and Stones.

2. class Solution {
3. public:
4.     int numJewelsInStones(string jewels, string stones) {
5.         int count=0;
6.         for(int i=0;i<jewels.length();i++)
7.         {
8.             for(int j=0;j<stones.length();j++)
9.             {
10.                 if(jewels[i]==stones[j])
11.                 {
12.                     count++;
13.                 }
14.             }
15.         }
16.         return count;
17.     }
18. };