@@ -0,0 +1,930 @@
+%22%22%22Leetcode 771. Jewels and Stones%0AEasy%0A%0AURL: https://leetcode.com/problems/jewels-and-stones/%0A%0AYou're given strings J representing the types of stones that are jewels,%0Aand S representing the stones you have.%0AEach character in S is a type of stone you have.%0AYou want to know how many of the stones you have are also jewels.%0A%0AThe letters in J are guaranteed distinct, and all characters in J and S are letters.%0ALetters are case sensitive, so %22a%22 is considered a different type of stone from %22A%22.%0A%0AExample 1:%0AInput: J = %22aA%22, S = %22aAAbbbb%22%0AOutput: 3%0A%0AExample 2:%0AInput: J = %22z%22, S = %22ZZ%22%0AOutput: 0%0A%0ANote:%0A- S and J will consist of letters and have length at most 50.%0A- The characters in J are distinct.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def numJewelsInStones(self, J, S):%0A        %22%22%22%0A        :type J: str%0A        :type S: str%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0771_jewels_and_stones.py