forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution2.py
32 lines (28 loc) · 945 Bytes
/
Solution2.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
class Node:
__slots__ = ['children', 'is_end']
def __init__(self):
self.children: List[Node | None] = [None] * 26
self.is_end = False
class Solution:
def minExtraChar(self, s: str, dictionary: List[str]) -> int:
root = Node()
for w in dictionary:
node = root
for c in w[::-1]:
i = ord(c) - ord('a')
if node.children[i] is None:
node.children[i] = Node()
node = node.children[i]
node.is_end = True
n = len(s)
f = [0] * (n + 1)
for i in range(1, n + 1):
f[i] = f[i - 1] + 1
node = root
for j in range(i - 1, -1, -1):
node = node.children[ord(s[j]) - ord('a')]
if node is None:
break
if node.is_end and f[j] < f[i]:
f[i] = f[j]
return f[n]