Class Solution
-
- All Implemented Interfaces:
public final class Solution
771 - Jewels and Stones\.
Easy
You're given strings
jewels
representing the types of stones that are jewels, andstones
representing the stones you have. Each character instones
is a type of stone you have. You want to know how many of the stones you have are also jewels.Letters are case sensitive, so
"a"
is considered a different type of stone from"A"
.Example 1:
Input: jewels = "aA", stones = "aAAbbbb"
Output: 3
Example 2:
Input: jewels = "z", stones = "ZZ"
Output: 0
Constraints:
1 <= jewels.length, stones.length <= 50
jewels
andstones
consist of only English letters.All the characters of
jewels
are unique.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
numJewelsInStones(String jewels, String stones)
-
-
Method Detail
-
numJewelsInStones
final Integer numJewelsInStones(String jewels, String stones)
-
-
-
-