Consecutive Characters (E)
題目
Given a string s, the power of the string is the maximum length of a non-empty substring that contains only one unique character.
Return the power of the string.
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.
Example 3:
Input: s = "triplepillooooow"
Output: 5
Example 4:
Input: s = "hooraaaaaaaaaaay"
Output: 11
Example 5:
Input: s = "tourist"
Output: 1
Constraints:
1 <= s.length <= 500scontains only lowercase English letters.
題意
計算給定字串中最長連續相同字符的長度，
思路
一次遍歷，
代碼實作
Java
class Solution {
public int maxPower(String s) {
int ans = 0;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (i > 0 && s.charAt(i) == s.charAt(i - 1)) {
count++;
} else {
ans = Math.max(ans, count);
count = 1;
}
}
ans = Math.max(ans, count);
return ans;
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/201756.html
標籤：其他
上一篇：STL 常用資料結構和演算法
下一篇：基于SVM的例外檢測方法