LeetCode之Partition Labels（Kotlin）

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/wanglikun7342/article/details/82951955

问题：
A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.

Example 1:
Input: S = "ababcbacadefegdehijhklij"
Output: [9,7,8]
Explanation:
The partition is "ababcbaca", "defegde", "hijhklij".
This is a partition so that each letter appears in at most one part.
A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits S into less parts.

---

方法：
向右遍历，当index与index所处位置字符的最右index相同时分组，当遍历完所有字符后输出即为结果。（我也知道不太好理解，看代码慢慢体会o(╯□╰)o）

具体实现：

class PartitionLabels {
    fun partitionLabels(S: String): List<Int> {
        val result = mutableListOf<Int>()

        val last = IntArray(26)

        for (i in S.indices) {
            last[S[i] - 'a'] = i
        }

        var j = 0
        var anchor = 0
        for (i in S.indices) {
            j = maxOf(j, last[S[i] - 'a'])
            if (i == j) {
                result.add(i - anchor + 1)
                anchor = i + 1
            }
        }

        return result
    }
}

fun main(args: Array<String>) {
    val partitionLabels = PartitionLabels()
    var string = "ababcbacadefegdehijhklij"
    println(partitionLabels.partitionLabels(string))
}

有问题随时沟通

具体代码实现可以参考Github