Files
obsidian/АиСД/Задачи/LeetCode/Jewels and Stones.md
T
roma-dxunvrs c90a404c40
deploy / Pull and Restart (push) Successful in 18s
Refactor
2026-09-19 19:20:43 +03:00

18 lines
467 B
Markdown

Leetcode #771 | #Easy | [[Хэш-таблицы]]
## Идея
Просто set
## Big-O
- Время ```O(N+M)```
- Память ```O(N)```
## Код
```Java
class Solution {
public int numJewelsInStones(String jewels, String stones) {
Set<Character> set = new HashSet<>();
for (char c : jewels.toCharArray()) set.add(c);
int res = 0;
for (char c : stones.toCharArray()) if (set.contains(c)) res++;
return res;
}
}
```