[LeetCod] Letter Combinations of a Phone Number - kotlin
방법1 - BackTrackingclass Solution { private val res = mutableListOf() private val digitToChar = arrayOf( "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" ) fun letterCombinations(digits: String): List { if(digits.isEmpty()) return res backtrack(0, "", digits) return res } private fun backtrack(index: Int, curStr: String, digits: String..
2025. 3. 6.