Repository navigation
Expand file tree
/
Copy pathMaximumNumberOfWordsYouCanType.cpp
More file actions
64 lines (58 loc) · 2.06 KB
/
Copy pathMaximumNumberOfWordsYouCanType.cpp
File metadata and controls
64 lines (58 loc) · 2.06 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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
// Source : https://leetcode.com/problems/maximum-number-of-words-you-can-type/
// Author : Hao Chen
// Date : 2021-07-22
/*****************************************************************************************************
*
* There is a malfunctioning keyboard where some letter keys do not work. All other keys on the
* keyboard work properly.
*
* Given a string text of words separated by a single space (no leading or trailing spaces) and a
* string brokenLetters of all distinct letter keys that are broken, return the number of words in
* text you can fully type using this keyboard.
*
* Example 1:
*
* Input: text = "hello world", brokenLetters = "ad"
* Output: 1
* Explanation: We cannot type "world" because the 'd' key is broken.
*
* Example 2:
*
* Input: text = "leet code", brokenLetters = "lt"
* Output: 1
* Explanation: We cannot type "leet" because the 'l' and 't' keys are broken.
*
* Example 3:
*
* Input: text = "leet code", brokenLetters = "e"
* Output: 0
* Explanation: We cannot type either word because the 'e' key is broken.
*
* Constraints:
*
* 1 <= text.length <= 10^4
* 0 <= brokenLetters.length <= 26
* text consists of words separated by a single space without any leading or trailing spaces.
* Each word only consists of lowercase English letters.
* brokenLetters consists of distinct lowercase English letters.
******************************************************************************************************/
class Solution {
public:
int canBeTypedWords(string text, string brokenLetters) {
vector<bool> borken(26, false);
for (auto ch : brokenLetters) {
borken[ch - 'a'] = true;
}
text += ' ';
int cnt = 0;
for (int i = 0; i < text.size(); i++ ) {
if ( text[i] == ' ') continue;
bool skip = false;
for (; text[i] != ' '; i++ ) {
if (borken[text[i] - 'a'] == true ) skip = true;
}
if ( !skip ) cnt++;
}
return cnt;
}
};