leetcode_409_Longest_Palindrome.kt

leetcode_409_Longest_Palindrome.kt

class Solution {
    fun longestPalindrome(s: String): Int {
        val map = mutableMapOf<Int, Int>()
        s.forEach {
            val value = map[it.toInt()]
            map[it.toInt()] = if (value == null) 1 else value + 1
        }

        val sumEvens = map.filter { it.value % 2 == 0 }
            .values
            .sum()

        val odds = map.filter { it.value % 2 != 0 }.values
        val sumOdds = if (odds.sum() == 0) 0 else odds.sum() - odds.size + 1

        return sumEvens + sumOdds
    }
}