-
Notifications
You must be signed in to change notification settings - Fork 0
/
challenges-51.js
36 lines (26 loc) · 953 Bytes
/
challenges-51.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
// #Question
// You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones 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 and stones consist of only English letters.
// All the characters of jewels are unique.
// #Solution
var numJewelsInStones = function (jewels, stones) {
let count = 0;
for (let i = 0; i < stones.length; i++) {
for (let a = 0; a < jewels.length; a++) {
if (jewels[a] === stones[i]) {
count++;
}
}
}
return count;
};
numJewelsInStones("aA", "aAABBBBbbbb");