-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconsecutive-characters.js
60 lines (47 loc) · 1.19 KB
/
consecutive-characters.js
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
59
60
/* Consecutive Characters
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.
*/
/**
* @param {string} s
* @return {number}
*/
var maxPower = function(s) {
s = s.split('');
let max = 1;
if(s.length === 1){
return 1;
}
let prev = 0, curr = 1;
while(curr < s.length){
if(s[prev] === s[curr]){
let currMax = curr - prev + 1;
max = Math.max(max,currMax);
curr++;
}else{
prev = curr;
curr += 1;
}
}
return max;
};