[数据结构与算法]LeetCode第1446题 Consecutive Characters(c++)

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.
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 <= 500
s consists of only lowercase English letters.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/consecutive-characters
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

题目大意：

返回只包含一种字符的最长非空子字符串的长度。

实现思路：

利用队列。

实现代码：

class Solution {
public:
    int maxPower(string s) {
        queue<char> q;
        int max=0;
        int n=s.length();
        for(char ch:s){
            q.push(ch);
            while(ch!=q.front()) q.pop();
            max=max>q.size()?max:q.size();
        }
        return max;
    }
};

?