# 问题描述：

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:**

1 | Input: J = "aA", S = "aAAbbbb" |

**Example 2:**

1 | Input: J = "z", S = "ZZ" |

**Note:**

`S`

and`J`

will consist of letters and have length at most 50.- The characters in
`J`

are distinct.

# 解决思路：

此题要解决的问题是：统计字符串S中所有出现在字符串J中的字符个数

# AC代码：

- C++

1 | class Solution { |

- python3

1 | class Solution: |