Introfor

from sys import stdin if __name__ == '__main__': l_stack = list(stdin.readline().rstrip()) r_stack = [] cnt = int(stdin.readline()) for cmd in stdin: if cmd[0] == 'L' and l_stack: r_stack.append(l_stack.pop()) if cmd[0] == 'D' and r_stack: l_stack.append(r_stack.pop()) if cmd[0] == 'B' and l_stack: l_stack.pop() if cmd[0] == 'P': l_stack.append(cmd[2]) print(''.join(l_stack+r_stack[::-1])) 백준 강의..

from sys import stdin if __name__ == '__main__': n = int(input()) seq = map(lambda x: int(x.rstrip()), stdin.readlines()) cnt, stack, result = 1, [], [] for i in seq: while cnt

기본적인 자료구조인 스택 관련 문제로 백준 사이트에 있는 문제를 풀어보았다. __author__ = 'hanayong' stack = [] def push(word): global stack for _ in range(len(word)): stack.append(word.pop()) def pop(): global stack if stack in []: return else: return stack.pop() def reserve_words(): global stack word_list = [] for _ in range(len(stack)): word_list.append(pop()[::-1]) print(' '.join(word_list)) if __name__ == '__main__': n = in..