-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy path408. Valid Word Abbreviation.c
67 lines (45 loc) · 1.55 KB
/
408. Valid Word Abbreviation.c
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
65
66
67
/*
408. Valid Word Abbreviation
Given a non-empty string s and an abbreviation abbr, return whether the string matches with the given abbreviation.
A string such as "word" contains only the following valid abbreviations:
["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]
Notice that only the above abbreviations are valid abbreviations of the string "word". Any other string is not a valid abbreviation of "word".
Note:
Assume s contains only lowercase letters and abbr contains only lowercase letters and digits.
Example 1:
Given s = "internationalization", abbr = "i12iz4n":
Return true.
Example 2:
Given s = "apple", abbr = "a2e":
Return false.
*/
bool validWordAbbreviation(char* word, char* abbr) {
int n = 0;
while (*abbr) {
if (*abbr >= '0' && *abbr <= '9') {
n = n * 10 + *abbr - '0';
if (!n) return false; // invalid input
} else {
while (n && *word) {
n --; word ++;
}
if (*word != *abbr) return false;
word ++;
}
abbr ++;
}
while (n && *word) {
n --; word ++;
}
return (n || *word) ? false : true;
}
/*
Difficulty:Easy
Total Accepted:11.1K
Total Submissions:39.6K
Companies Google
Related Topics String
Similar Questions
Minimum Unique Word Abbreviation
Word Abbreviation
*/