Leetcode-Challenges/consecutiveCharacters.cpp at main · Ojaswi2000/Leetcode-Challenges · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
/**
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
*/
class Solution {
public:
    int maxPower(string s) {
        int curr=0,maxl=0;
        if(s.size()==1)
            return 1;
        for(int i=0;i<s.length();i++)
        {
            if(s[i]==s[i+1])
                curr++;
            else
                curr=0;
            maxl=max(maxl,curr);
        }
        return maxl+1;
    }
};