LeetCode-Jewels and Stones java 宝石计算

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.

你得到的字符串J代表的是宝石的类型，S代表你拥有的宝石。 S中的每个角色都是你拥有的一种石头。 你想知道你有多少宝石也是宝石。

J中的字母保证不同，J和S中的所有字符都是字母。 字母区分大小写，所以“a”被认为是与“A”不同类型的石头。

解法，把J的装成set然后for一下S的字符就可以了

 

public static int numJewelsInStones(String J, String S) {
		int num = 0;
		Set<Character> set = new HashSet<>();
		for (int i = 0; i < J.length(); i++) {
			set.add(J.charAt(i));
		}

		for (int i = 0; i < S.length(); i++) {
			if (set.contains(S.charAt(i))) {
				num++;
			}
		}

		return num;

	}