Description:

You're given stringsJrepresenting the types of stones that are jewels, andSrepresenting the stones you have. Each character inSis a type of stone you have. You want to know how many of the stones you have are also jewels.

The letters inJare guaranteed distinct, and all characters inJandSare letters. Letters are case sensitive, so"a"is considered a different type of stone from"A".

Example:

Example 1:

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

Example 2:

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

Note:

  • SandJwill consist of letters and have length at most 50.
  • The characters inJare distinct.

Answer:(Using C++ language)

class Solution {
public:
    int numJewelsInStones(string J, string S) {
        int counting=0;
        for(int i=0;J.length();i++){
            for(int j=0;S.length();j++\){
                if(J[i]==S[j]) counting++;
            }
        }
        return counting;
    }
};

Facing Problem:

  • No post-increment operator for type?

-> It means that you don't declare your variable before, you need to declare it.

  • String processing?

->cin >>, cout << , String.length(),

->Using string[number] can get the corresponding element in string position.

Reference:

jewels-and-stones

results matching ""

    No results matching ""