Valid Word Abbreviation
Given anon-emptystrings
and an abbreviationabbr
, 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:
Assumes
contains only lowercase letters andabbr
contains only lowercase letters and digits.
Example 1:
Given s= "internationalization",
abbr= "i12iz4n":
Return true.
Example 2:
Given s= "apple",
abbr= "a2e":
Return false.
这道题让我们验证单词缩写,关于单词缩写LeetCode上还有两道相类似的题目Unique Word Abbreviation和Generalized Abbreviation。这道题给了我们一个单词和一个缩写形式,让我们验证这个缩写形式是否是正确的,由于题目中限定了单词中只有小写字母和数字,所以我们只要对这两种情况分别处理即可。我们使用双指针分别指向两个单词的开头,遍历abbr,如果指向缩写单词的指针指的是一个数字的话,如果当前数字是0,返回false,因为数字不能以0开头,然后我们要把该数字整体取出来,所以我们用一个while循环将数字整体取出来,然后指向原单词的指针也要对应的向后移动这么多位数。如果指向缩写单词的指针指的是一个字母的话,那么我们只要比两个指针指向的字母是否相同,不同则返回false,相同则两个指针均向后移动一位,
Last updated
Was this helpful?