给定一组字符,使用原地算法将其压缩。
压缩后的长度必须始终小于或等于原数组长度。
数组的每个元素应该是长度为1 的字符(不是 int 整数类型)。
在完成原地修改输入数组后,返回数组的新长度。
示例 1:
输入:
["a","a","b","b","c","c","c"]
输出:
返回6,输入数组的前6个字符应该是:["a","2","b","2","c","3"]
说明:
"aa"被"a2"替代。"bb"被"b2"替代。"ccc"被"c3"替代。
示例 2:
输入:
["a"]
输出:
返回1,输入数组的前1个字符应该是:["a"]
说明:
没有任何字符串被替代。
解法:
func compress(_ chars: inout [Character]) -> Int {
let count:Int = chars.count
guard count > 0 else {
return 0
}
var result:String = ""
var first:Character = chars[0] as Character
var charCount:Int = 0
for i in 0..<count {
let temp:Character = chars[i] as Character
if temp == first {
charCount += 1
} else {
result.append(first)
if charCount > 1 {
result.append("\(charCount)")
}
first = temp
charCount = 1
}
}
result.append(first)
if charCount > 1 {
result.append("\(charCount)")
}
return result.count
}