LeetCode in Kotlin

771. Jewels and Stones

Easy

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.

Solution

class Solution {
    fun numJewelsInStones(jewels: String, stones: String): Int {
        val x = IntArray(60)
        var count = 0
        val len = jewels.length
        val len2 = stones.length
        for (i in 0 until len) {
            x[jewels[i].code - 65]++
        }
        for (i in 0 until len2) {
            if (x[stones[i].code - 65] == 1) {
                count++
            }
        }
        return count
    }
}

This site is open source. Improve this page.