LeetCode in Kotlin

2663. Lexicographically Smallest Beautiful String

Hard

A string is beautiful if:

• It consists of the first k letters of the English lowercase alphabet.
• It does not contain any substring of length 2 or more which is a palindrome.

You are given a beautiful string s of length n and a positive integer k.

Return the lexicographically smallest string of length n, which is larger than s and is beautiful. If there is no such string, return an empty string.

A string a is lexicographically larger than a string b (of the same length) if in the first position where a and b differ, a has a character strictly larger than the corresponding character in b.

• For example, "abcd" is lexicographically larger than "abcc" because the first position they differ is at the fourth character, and d is greater than c.

Example 1:

Input: s = “abcz”, k = 26

Output: “abda”

Explanation:

The string “abda” is beautiful and lexicographically larger than the string “abcz”.

It can be proven that there is no string that is lexicographically larger than the string “abcz”, beautiful, and lexicographically smaller than the string “abda”.

Example 2:

Input: s = “dc”, k = 4

Output: “”

Explanation: It can be proven that there is no string that is lexicographically larger than the string “dc” and is beautiful.

Constraints:

• 1 <= n == s.length <= 105
• 4 <= k <= 26
• s is a beautiful string.

Solution

class Solution {
    fun smallestBeautifulString(s: String, k: Int): String {
        val n = s.length
        val charr = s.toCharArray()
        for (i in n - 1 downTo 0) {
            ++charr[i]
            var canbuild = true
            if (charr[i] > 'a' + k - 1) continue
            while (!isValid(charr, i)) {
                ++charr[i]
                if (charr[i] > 'a' + k - 1) {
                    canbuild = false
                    break
                }
            }
            if (!canbuild) continue
            for (j in i + 1 until n) {
                charr[j] = 'a'
                while (!isValid(charr, j)) {
                    ++charr[j]
                }
            }
            return StringBuilder().append(charr).toString()
        }
        return ""
    }

    private fun isValid(s: CharArray, i: Int): Boolean {
        if (i - 1 >= 0 && s[i - 1] == s[i]) return false
        if (i - 2 >= 0 && s[i - 2] == s[i]) return false
        return true
    }
}

This site is open source. Improve this page.