题目描述
给你一个字符串 s ，字符串的「能量」定义为：只包含一种字符的最长非空子字符串的长度。
请你返回字符串的能量。
解题代码
// 滑动窗口 func maxPower(s string) int { res := 0 fIndex := 0 aIndex := 0 for aIndex < len(s) { if s[aIndex] == s[fIndex] { aIndex ++ } else { if res < aIndex - fIndex { res = aIndex - fIndex } fIndex = aIndex } } if res < aIndex - fIndex { res = aIndex - fIndex } return res }
提交结果
![每日一题 --- 942. 增减字符串匹配[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/33c49f74e2134ecbb3909bd2c64c103d.png?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 --- 442. 数组中重复的数据[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/9b41d0e542eb4e2083fcb4816bc77bd0.png?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 --- 933. 最近的请求次数[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/f1f6220e3f64477dbd6ba9c8513a969c.png?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 --- 713. 乘积小于 K 的子数组[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/f49960bd48ac42cd9a7872492445fb35.png?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 --- 606. 根据二叉树创建字符串[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/cdc7b7bbd9f54fea8cba70533014c1af.png?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 ---- 599. 两个列表的最小索引总和[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/img_convert/555aaf2f092992e163a01f6991dca770.gif#pic_center?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 --- 393. UTF-8 编码验证[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/2cafda7e94544cd4988047ed3c52a3c8.png?x-oss-process=image/resize,h_160,m_lfit)
![每日一题 --- 590. N 叉树的后序遍历[力扣][Go]](https://ucc.alicdn.com/images/user-upload-01/c16b0227eca7426bb3bceba13dfa74ec.png?x-oss-process=image/resize,h_160,m_lfit)