Problem

You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.

Letters are case sensitive, so "a" is considered a different type of stone from "A".

Example 1:

Input: jewels = "aA", stones = "aAAbbbb"
Output: 3

Example 2:

Input: jewels = "z", stones = "ZZ"
Output: 0

Constraints:

1 <= jewels.length, stones.length <= 50
jewels and stones consist of only English letters.
All the characters of jewels are unique.

My code

class Solution:
    def numJewelsInStones(self, jewels: str, stones: str) -> int:
        count = 0
        for i in stones:
            if i in jewels:
                count += 1
        return count

Review

[실행 결과]
Runtime: 28 ms Memory Usage: 14.2 MB

[접근법]
하나하나 비교... stones에서 jewels찾기.

[느낀점]
솔직히 양심없이 문제 푼거 인정한다... 그치만 아침엔 이런 생각밖에 안난다구요,,,:메스꺼운_얼굴: