这篇博客介绍了LeetCode上的771题——宝石与石头。文章通过分析题目，提出利用ASCII码和数组优化搜索，将时间复杂度降低到O(n+m)，并给出了具体的C++解决方案。
题目描述
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: 3Example 2:
Input: J = "z", S = "ZZ"
Output: 0
最低0.47元/天 解锁文章
扫一扫
162
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
