LeetCode之Jewels and Stones（Kotlin）

問題： 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".

---

方法： 將J中元素存到set中，遍歷S同時統計S中包含的J中元素的數量，最後輸出統計的結果。

具體實現：

class JewelsAndStones {
    fun numJewelsInStones(J: String, S: String): Int {
        val map = mutableSetOf<Char>()
        var count = 0
        for (ch in J) {
            map.add(ch)
        }
        for (ch in S) {
            if (map.contains(ch)) {
                count++
            }
        }
        return count
    }
}

fun main(args: Array<String>) {
    val J = "aA"
    val S = "aAAbbbb"
    val jewelsAndStones = JewelsAndStones()
    val result = jewelsAndStones.numJewelsInStones(J, S)
    println("result: $result")
}
複製代碼

有問題隨時溝通

具體代碼實現能夠參考Github