https://leetcode.com/problems/jewels-and-stones/description/
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
andJ
will consist of letters and have length at most 50.- The characters in
J
are distinct.
宝石与石头
python3:
class Solution: def numJewelsInStones(self, J, S): """ :type J: str :type S: str :rtype: int """ info = set(J) ans = 0 for c in S: if c in info: ans += 1 return ans
javascript:
/** * @param {string} J * @param {string} S * @return {number} */ var numJewelsInStones = function(J, S) { var res = 0; for(var index in J){ for(var i in S){ if(S[i]==J[index]){ res++; } } } return res; };