g1701_1800.s1702_maximum_binary_string_after_change.Solution.kt Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.32

package g1701_1800.s1702_maximum_binary_string_after_change

// #Medium #String #Greedy #2023_06_15_Time_343_ms_(100.00%)_Space_42.6_MB_(100.00%)

class Solution {
    fun maximumBinaryString(binary: String): String {
        val bs = binary.toCharArray()
        var zcount = 0
        var pos = -1
        for (i in bs.indices.reversed()) {
            if (bs[i] == '0') {
                bs[i] = '1'
                zcount++
                pos = i
            }
        }
        if (pos >= 0) {
            bs[pos + zcount - 1] = '0'
        }
        return String(bs)
    }
}