알고리즘 백준- 10828 스택

var input = require('fs').readFileSync('/dev/stdin').toString().split('\n')

function CreateStack(input) {
  const stack = []
  const answer = []

  const commands = {
    push: (data) => {
      stack.push(data[1])
    },
    pop: () => {
      return stack.length > 0 ? stack.pop() : -1
    },
    size: () => {
      return stack.length
    },
    empty: () => {
      return stack.length === 0 ? 1 : 0
    },
    top: () => {
      return stack.length > 0 ? stack[stack.length - 1] : -1
    },
  }

  for (let i = 0; i < input.length; ++i) {
    const data = input[i].trim().split(' ')
    const command = data[0]

    if (commands[command]) {
      const result = commands[command](data)
      if (result !== undefined) {
        answer.push(result)
      }
    }
  }
  console.log(answer.join('\n'))
}

CreateStack(input)

import sys
n = int(sys.stdin.readline())
stack = []

for i in range(n):
    command = sys.stdin.readline().split()
    if command[0] == 'push':
        stack.append(command[1])
    elif command[0]  == 'pop':
        if not stack:
            print(-1)
        else:
            print(stack.pop())
    elif command[0] == 'size':
        print(len(stack))
    elif command[0] == 'empty':
        print(int(len(stack) == 0))
    elif command[0] == 'top':
        if not stack:
            print(-1)
        else:
            print(stack[-1])