LeetCode in Kotlin
1446. Consecutive Characters
Easy
The power of the string is the maximum length of a non-empty substring that contains only one unique character.
Given a string s, return the power of s.
Example 1:
Input: s = “leetcode”
Output: 2
Explanation: The substring “ee” is of length 2 with the character ‘e’ only.
Example 2:
Input: s = “abbcccddddeeeeedcba”
Output: 5
Explanation: The substring “eeeee” is of length 5 with the character ‘e’ only.
Constraints:
1 <= s.length <= 500sconsists of only lowercase English letters.
Solution
class Solution {
fun maxPower(s: String): Int {
var max = 0
var i = 0
while (i < s.length) {
val start = i
while (i + 1 < s.length && s[i] == s[i + 1]) {
i++
}
max = Math.max(max, i - start + 1)
i++
}
return max
}
}