Node.js) 백준 28432번: 끝말잇기

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

28432번: 끝말잇기

 

const input = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.trim());
const N = +input.shift();
const words = [];
let Q;
for (let i = 0; i < N; i++) {
	const word = input.shift();
	words.push(word);
	if (word == '?') Q = i;
}
let front = '';
if (Q > 0) {
	front = words[Q - 1].split('').pop();
}

let rear = '';
if (Q + 1 < words.length) {
	rear = words[Q + 1].split('').shift();
}

const M = +input.shift();

for (let i = 0; i < M; i++) {
	const possible = input.shift();
	if (words.includes(possible)) continue;
	if (possible.startsWith(front) && possible.endsWith(rear)) {
		console.log(possible);
		break;
	}
}