<filename>leetcode-algorithms/771. Jewels and Stones/771.jewels-and-stones.py
#
# @lc app=leetcode id=771 lang=python3
#
# [771] Jewels and Stones
#
# https://leetcode.com/problems/jewels-and-stones/description/
#
# algorithms
# Easy (82.77%)
# Total Accepted:    234.4K
# Total Submissions: 282.4K
# Testcase Example:  '"aA"\n"aAAbbbb"'
#
# 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.
#
#
#


class Solution:
    def numJewelsInStones(self, J: str, S: str) -> int:
        sol = 0
        for ch1 in S:
            if ch1 in J:
                sol += 1
        return sol

<filename>leetcode-algorithms/771. Jewels and Stones/771.jewels-and-stones.py
#
# @lc app=leetcode id=771 lang=python3
#
# [771] Jewels and Stones
#
# https://leetcode.com/problems/jewels-and-stones/description/
#
# algorithms
# Easy (82.77%)
# Total Accepted:    234.4K
# Total Submissions: 282.4K
# Testcase Example:  '"aA"\n"aAAbbbb"'
#
# 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.
#
#
#


class Solution:
    def numJewelsInStones(self, J: str, S: str) -> int:
        sol = 0
        for ch1 in S:
            if ch1 in J:
                sol += 1
        return sol

# # @lc app=leetcode id=771 lang=python3 # # [771] Jewels and Stones # # https://leetcode.com/problems/jewels-and-stones/description/ # # algorithms # Easy (82.77%) # Total Accepted:    234.4K # Total Submissions: 282.4K # Testcase Example:  '"aA"\n"aAAbbbb"' # # 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. # # #