Your friend is typing his name
into a keyboard. Sometimes, when typing a character c
, the key might get long pressed, and the character will be typed 1 or more times.
You examine the typed
characters of the keyboard. Return True
if it is possible that it was your friends name, with some characters (possibly none) being long pressed.
Input: name = "alex", typed = "aaleex" Output: true Explanation: 'a' and 'e' in 'alex' were long pressed.
Input: name = "saeed", typed = "ssaaedd" Output: false Explanation: 'e' must have been pressed twice, but it wasn't in the typed output.
Input: name = "leelee", typed = "lleeelee" Output: true
Input: name = "laiden", typed = "laiden" Output: true Explanation: It's not necessary to long press any character.
name.length <= 1000
typed.length <= 1000
- The characters of
name
andtyped
are lowercase letters.
class Solution:
def isLongPressedName(self, name: str, typed: str) -> bool:
n_cnt = []
cnt = 1
for i in range(len(name)):
if i < len(name) - 1 and name[i] == name[i + 1]:
cnt += 1
else:
n_cnt.append((name[i], cnt))
cnt = 1
t_cnt = []
cnt = 1
for i in range(len(typed)):
if i < len(typed) - 1 and typed[i] == typed[i + 1]:
cnt += 1
else:
t_cnt.append((typed[i], cnt))
cnt = 1
return all(n[0] == t[0] and n[1] <= t[1] for n, t in zip(n_cnt, t_cnt)) and len(n_cnt) == len(t_cnt)
class Solution:
def isLongPressedName(self, name: str, typed: str) -> bool:
i = 0
for c in typed:
if i < len(name) and name[i] == c:
i += 1
elif i == 0 or name[i - 1] != c:
return False
return i == len(name)