g0701_0800.s0771_jewels_and_stones.Solution.kt Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.28

package g0701_0800.s0771_jewels_and_stones

// #Easy #String #Hash_Table #2023_03_10_Time_143_ms_(99.08%)_Space_33.5_MB_(100.00%)

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
    }
}