-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3.cpp
58 lines (42 loc) · 1.08 KB
/
3.cpp
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/*
Consecutive Characters
----------------------
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 ans = 1, current_count = 1;
for(int i=1; i<s.size(); i++) {
if(s[i] == s[i-1]) {
current_count++;
ans = max(ans, current_count);
} else {
ans = max(ans, current_count);
current_count = 1;
}
}
return ans;
}
};