1446. Consecutive Characters.cpp

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










class Solution {
public:
    int maxPower(string s) {
        int n=s.length();
        int maxi=1, cnt=1;
        for(int i=0;i<n-1;i++){
            if(s[i]==s[i+1]){
                cnt++;
            } else cnt=1;
            if(cnt>maxi) maxi=cnt;
        }
        return maxi;
    }
};




class Solution {
public:
    int maxPower(string s) {
        int n=s.length();
        int maxi=0, cnt=0;
        for(int i=0;i<n-1;i++){
            if(s[i]==s[i+1]){
                cnt++;
                maxi=max(maxi, cnt);
            } else cnt=0;
        }
        return maxi+1;
    }
};