-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path925 Long Pressed Name.py
59 lines (47 loc) · 1.45 KB
/
925 Long Pressed Name.py
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
#!/usr/bin/python3
"""
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.
Example 1:
Input: name = "alex", typed = "aaleex"
Output: true
Explanation: 'a' and 'e' in 'alex' were long pressed.
Example 2:
Input: name = "saeed", typed = "ssaaedd"
Output: false
Explanation: 'e' must have been pressed twice, but it wasn't in the typed output.
Example 3:
Input: name = "leelee", typed = "lleeelee"
Output: true
Example 4:
Input: name = "laiden", typed = "laiden"
Output: true
Explanation: It's not necessary to long press any character.
Note:
name.length <= 1000
typed.length <= 1000
The characters of name and typed are lowercase letters.
"""
class Solution:
def isLongPressedName(self, name: str, typed: str) -> bool:
"""
two pointers
"""
m, n = len(name), len(typed)
i, j = 0, 0
while i < m and j < n:
if name[i] == typed[j]:
i += 1
j += 1
elif j - 1 >= 0 and typed[j-1] == typed[j]:
j += 1
else:
return False
# tail
while j - 1 >= 0 and j < n and typed[j-1] == typed[j]:
j += 1
return i == m and j == n