포소니 포소니

코틀린

• 가장 긴 공통 접두사

  Tech/Algorithm 2023. 10. 29. 13:14

  fun longestCommonPrefix(strs: Array): String { if (strs.isEmpty()) return "" strs.sort() val first = strs[0] val last = strs[strs.size - 1] var i = 0 while (i < first.length && first[i] == last[i]) i++ return first.substring(0, i) }

  Read More
• 유효한 괄호 문자열 확인

  Tech/Algorithm 2023. 10. 29. 13:12

  fun isValidParentheses(s: String): Boolean { val stack = ArrayDeque() for (char in s) { when (char) { '(', '[', '{' -> stack.addLast(char) ')' -> if (stack.isEmpty() || stack.removeLast() != '(') return false ']' -> if (stack.isEmpty() || stack.removeLast() != '[') return false '}' -> if (stack.isEmpty() || stack.removeLast() != '{') return false } } return stack.isEmpty() } fun main() { println..

  Read More
• 최빈 단어 찾기

  Tech/Algorithm 2023. 10. 29. 13:12

  fun mostFrequentWord(s: String): Pair? { val words = s.split(' ') val frequencyMap = words.groupingBy { it }.eachCount() return frequencyMap.maxByOrNull { it.value } } fun main() { val (word, frequency) = mostFrequentWord("this is a sample program and it is a sample") ?: Pair("", 0) println("$word: $frequency") // "sample: 2" }

  Read More
• 공백으로 단어 뒤집기

  Tech/Algorithm 2023. 10. 29. 12:58

  fun reverseWords(s: String): String { return s.split(' ').joinToString(" ") { it.reversed() } } fun main() { println(reverseWords("Hello World")) // "olleH dlroW" }

  Read More
• 중복문자 제거

  Tech/Algorithm 2023. 10. 29. 12:52

  fun removeDuplicates(s: String): String { return s.toSet().joinToString("") } fun main() { println(removeDuplicates("banana")) // "ban" (순서는 보장되지 않음) }

  Read More
• 문자열 뒤집기

  Tech/Algorithm 2023. 10. 29. 12:52

  fun reverseString(s: String): String { return s.reversed() } fun main() { println(reverseString("Hello World")) // "dlroW olleH" }

  Read More