g0501_0600.s0553_optimal_division.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.30

package g0501_0600.s0553_optimal_division

// #Medium #Array #Dynamic_Programming #Math #2023_01_17_Time_154_ms_(100.00%)_Space_34_MB_(66.67%)

class Solution {
    fun optimalDivision(nums: IntArray): String {
        val sb = StringBuilder()
        if (nums.size == 1) {
            sb.append(nums[0])
            return sb.toString()
        }
        if (nums.size == 2) {
            sb.append(nums[0])
            sb.append("/")
            sb.append(nums[1])
            return sb.toString()
        }
        sb.append(nums[0])
        sb.append("/")
        sb.append("(")
        for (i in 1 until nums.size - 1) {
            sb.append(nums[i])
            sb.append('/')
        }
        sb.append(nums[nums.size - 1])
        sb.append(")")
        return sb.toString()
    }
}