ARTS-第一周(2019.06.30)

最新推荐文章于 2020-01-11 23:39:03 发布

aicc2013

最新推荐文章于 2020-01-11 23:39:03 发布

阅读量102

点赞数

分类专栏： study 文章标签： ARTS 打卡极客时间左耳听风

本文链接：https://blog.csdn.net/weixin_39601599/article/details/94361317

版权

study 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

每周完成一个ARTS：(Algorithm、Review、Tip、Share, ARTS)**

Algorithm 每周至少做一个 leetcode 的算法题-主要是为了编程训练和学习
Review 阅读并点评至少一篇英文技术文章-主要是为了学习英文，如果你的英文不行，你基本上无缘技术高手
Tip 学习至少一个技术技巧-主要是为了总结和归纳你在是常工作中所遇到的知识点
Share – 分享一篇有观点和思考的技术文章-主要是为了建立你的影响力，能够输出价值观

Algorithm

Algorithm url：https://leetcode.com/problems/jewels-and-stones/
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 and J will consist of letters and have length at most 50.
The characters in J are distinct.

My Answer:

   class Solution {
    public int numJewelsInStones(String J, String S) {
        int totalNum = 0 ;
        HashSet hs = new HashSet();

        for (char c : J.toCharArray()){
            hs.add(c);
        }

        for (char c : S.toCharArray()){
            if (hs.contains(c)){
                totalNum++;
            }
        }

        return totalNum;
    }
}