Node.js) 백준 17178번: 줄서기

https://www.acmicpc.net/problem/17178

17178번: 줄서기

 

class Node {
	constructor(item) {
		this.item = item;
		this.prev = null;
	}
}

class Stack {
	constructor() {
		this.top = null;
		this.size = 0;
	}

	push(item) {
		const node = new Node(item);
		node.prev = this.top;
		this.top = node;
		this.size += 1;
	}

	pop() {
		const popItem = this.top;
		this.top = this.top.prev;
		this.size -= 1;
		return popItem.item;
	}
}

const stack = new Stack();
let [[N], ...jool] = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.split(' '));
N = +N;

jool = jool.flat().map((v) => {
	const [alpha, num] = v.split('-');
	return alpha.charCodeAt(0) * 1000 + Number(num);
});
const order = [...jool].sort((a, b) => a - b);

while (jool.length > 0 || stack.size > 0) {
	if (jool[0] == order[0]) {
		jool.shift();
		order.shift();
	} else if (stack.size == 0) {
		stack.push(jool.shift());
	} else if (stack.top.item == order[0]) {
		stack.pop();
		order.shift();
	} else if (jool[0] < stack.top.item) {
		stack.push(jool.shift());
	} else if (jool[0] > stack.top.item) {
		console.log('BAD');
		process.exit();
	}
}

console.log('GOOD');