-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpossibleStringCount.js
More file actions
50 lines (39 loc) · 1.19 KB
/
possibleStringCount.js
File metadata and controls
50 lines (39 loc) · 1.19 KB
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
/**
Alice is attempting to type a specific string on her computer. However, she tends to be clumsy and may press a key for too long, resulting in a character being typed multiple times.
Although Alice tried to focus on her typing, she is aware that she may still have done this at most once.
You are given a string word, which represents the final output displayed on Alice's screen.
Return the total number of possible original strings that Alice might have intended to type.
Example 1:
Input: word = "abbcccc"
Output: 5
Explanation:
The possible strings are: "abbcccc", "abbccc", "abbcc", "abbc", and "abcccc".
Example 2:
Input: word = "abcd"
Output: 1
Explanation:
The only possible string is "abcd".
Example 3:
Input: word = "aaaa"
Output: 4
Constraints:
1 <= word.length <= 100
word consists only of lowercase English letters.
* @param {string} word
* @return {number}
*/
var possibleStringCount = function (word) {
let count = 1;
let charOccurence = 1;
for (let i = 0; i < word.length; i++) {
if (word[i] == word[i + 1]) {
charOccurence++;
} else {
if (charOccurence > 1) {
count += charOccurence - 1;
}
charOccurence = 1;
}
}
return count;
};