-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathsolution.py
29 lines (29 loc) · 1.04 KB
/
solution.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
class Solution(object):
def pushDominoes(self, dominoes):
"""
:type dominoes: str
:rtype: str
"""
N = len(dominoes)
force = [0] * N
tmp_force = 0
for idx, domino in enumerate(dominoes):
if domino == 'R':
tmp_force = len(dominoes)
force[idx] += tmp_force
elif domino == '.':
tmp_force = tmp_force - 1 if tmp_force else 0
force[idx] += tmp_force if tmp_force else 0
else:
tmp_force = 0
tmp_force = 0
for idx, domino in enumerate(reversed(dominoes)):
if domino == 'L':
tmp_force = len(dominoes)
force[N - 1 - idx] -= tmp_force
elif domino == '.':
tmp_force = tmp_force - 1 if tmp_force else 0
force[N - 1 - idx] -= tmp_force if tmp_force else 0
else:
tmp_force = 0
return ''.join(map(lambda x: 'L' if x < 0 else 'R' if x > 0 else '.', force))