LeetCode in Kotlin
1405. Longest Happy String
Medium
A string s is called happy if it satisfies the following conditions:
sonly contains the letters'a','b', and'c'.sdoes not contain any of"aaa","bbb", or"ccc"as a substring.scontains at mostaoccurrences of the letter'a'.scontains at mostboccurrences of the letter'b'.scontains at mostcoccurrences of the letter'c'.
Given three integers a, b, and c, return the longest possible happy string. If there are multiple longest happy strings, return any of them. If there is no such string, return the empty string "".
A substring is a contiguous sequence of characters within a string.
Example 1:
Input: a = 1, b = 1, c = 7
Output: “ccaccbcc”
Explanation: “ccbccacc” would also be a correct answer.
Example 2:
Input: a = 7, b = 1, c = 0
Output: “aabaa”
Explanation: It is the only correct answer in this case.
Constraints:
0 <= a, b, c <= 100a + b + c > 0
Solution
class Solution {
fun longestDiverseString(a: Int, b: Int, c: Int): String {
val sb = StringBuilder()
val remains = intArrayOf(a, b, c)
val chars = charArrayOf('a', 'b', 'c')
var preIndex = -1
do {
var index: Int
var largest: Boolean
if (preIndex != -1 &&
remains[preIndex]
== Math.max(remains[0], Math.max(remains[1], remains[2]))
) {
index = if (preIndex == 0) {
if (remains[1] > remains[2]) 1 else 2
} else if (preIndex == 1) {
if (remains[0] > remains[2]) 0 else 2
} else {
if (remains[0] > remains[1]) 0 else 1
}
largest = false
} else {
index = if (remains[0] > remains[1]) 0 else 1
index = if (remains[index] > remains[2]) index else 2
largest = true
}
remains[index]--
sb.append(chars[index])
if (remains[index] > 0 && largest) {
remains[index]--
sb.append(chars[index])
}
preIndex = index
} while (remains[0] + remains[1] + remains[2] != remains[preIndex])
return sb.toString()
}
}