lintcode入门篇十六

class Solution:
    """
    @param J: the types of stones that are jewels
    @param S: representing the stones you have
    @return: how many of the stones you have are also jewels
    """
    ‘‘‘
    大致思路:
    1.J中代表的是珠宝的类型，初始化J_dic = []，将J中各个字符append到J_dic里面。
    2.初始化count = 0，循环S，如果当前字符在J_dic里面的话，说明是珠宝，count += 1。返回count
    ‘‘‘
    def numJewelsInStones(self,J,S):
        J_dic = [i for i in J]
        
        count = 0 
        for num in S:
            if num in J_dic:
                count += 1
        return count