# C#LeetCode刷题之#771-宝石与石头（Jewels and Stones）

J 中的字母不重复，J 和 S中的所有字符都是字母。字母区分大小写，因此”a”和”A”是不同类型的石头。

S 和 J 最多含有50个字母。
J 中的字符不重复。

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”.

Input: J = “aA”, S = “aAAbbbb”

Output: 3

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.

```public class Program {

public static void Main(string[] args) {
var J = "aA";
var S = "aAAbbbb";

var res = NumJewelsInStones(J, S);
Console.WriteLine(res);

J = "z";
S = "ZZ";

res = NumJewelsInStones2(J, S);
Console.WriteLine(res);

}

private static int NumJewelsInStones(string J, string S) {
var res = 0;
foreach(var c in S) {
if(J.Contains(c)) res++;
}
return res;
}

private static int NumJewelsInStones2(string J, string S) {
var res = 0;
var set = new HashSet<char>();
foreach(var c in J) {
}
foreach(var c in S) {
if(set.Contains(c)) res++;
}
return res;
}

}```

```3
0```

(2)