/
main.py
55 lines (45 loc) · 1.53 KB
/
main.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
# 2021 카카오 채용연계형 인턴십 표 편집
#
# 유튜브 문제 풀이: https://youtu.be/mlJu7Y4kg0o
#
# 파이썬 소스: https://bit.ly/3NBBIu4
#
# 문제 링크: https://school.programmers.co.kr/learn/courses/30/lessons/81303
def solution(N, K, cmds):
nodes = [Node(idx-1, idx, idx+1, 'O') for idx in range(N)]
crnt = nodes[K]
deleted_nodes = []
for cmd in cmds:
if cmd[0] == 'U':
for _ in range(int(cmd.split(' ')[1])):
crnt = nodes[crnt.prev]
elif cmd[0] == 'D':
for _ in range(int(cmd.split(' ')[1])):
crnt = nodes[crnt.next]
elif cmd[0] == 'C':
crnt.ox = 'X'
deleted_nodes.append(crnt)
if crnt.prev >= 0:
nodes[crnt.prev].next = crnt.next
if crnt.next < N:
nodes[crnt.next].prev = crnt.prev
crnt = nodes[crnt.next]
else:
crnt = nodes[crnt.prev]
elif cmd[0] == 'Z':
restored_node = deleted_nodes.pop()
restored_node.ox = 'O'
if restored_node.prev >= 0:
nodes[restored_node.prev].next = restored_node.idx
if restored_node.next < N:
nodes[restored_node.next].prev = restored_node.idx
answer = ''
for node in nodes:
answer += node.ox
return answer
class Node:
def __init__(self, prev_idx, idx, next_idx, ox):
self.ox = ox
self.prev = prev_idx
self.idx = idx
self.next = next_idx