forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
add-bold-tag-in-string.py
69 lines (60 loc) · 1.91 KB
/
add-bold-tag-in-string.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
60
61
62
63
64
65
66
67
68
# Time: O(n * d * l), l is the average string length
# Space: O(n)
import collections
import functools
# 59ms
class Solution(object):
def addBoldTag(self, s, dict):
"""
:type s: str
:type dict: List[str]
:rtype: str
"""
lookup = [0] * len(s)
for d in dict:
pos = s.find(d)
while pos != -1:
lookup[pos:pos+len(d)] = [1] * len(d)
pos = s.find(d, pos + 1)
result = []
for i in xrange(len(s)):
if lookup[i] and (i == 0 or not lookup[i-1]):
result.append("<b>")
result.append(s[i])
if lookup[i] and (i == len(s)-1 or not lookup[i+1]):
result.append("</b>")
return "".join(result)
# Time: O(n * l), l is the average string length
# Space: O(t) , t is the size of trie
# trie solution, 439ms
class Solution2(object):
def addBoldTag(self, s, words):
"""
:type s: str
:type words: List[str]
:rtype: str
"""
_trie = lambda: collections.defaultdict(_trie)
trie = _trie()
for i, word in enumerate(words):
functools.reduce(dict.__getitem__, word, trie).setdefault("_end")
lookup = [False] * len(s)
for i in xrange(len(s)):
curr = trie
k = -1
for j in xrange(i, len(s)):
if s[j] not in curr:
break
curr = curr[s[j]]
if "_end" in curr:
k = j
for j in xrange(i, k+1):
lookup[j] = True
result = []
for i in xrange(len(s)):
if lookup[i] and (i == 0 or not lookup[i-1]):
result.append("<b>")
result.append(s[i])
if lookup[i] and (i == len(s)-1 or not lookup[i+1]):
result.append("</b>")
return "".join(result)