Node.js) 백준 1897번: 토달기

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

1897번: 토달기

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

class Queue {
	constructor() {
		this.head = null;
		this.tail = null;
		this.length = 0;
	}

	push(item) {
		const node = new Node(item);
		if (this.head == null) {
			this.head = node;
		} else {
			this.tail.next = node;
		}

		this.tail = node;
		this.length += 1;
	}

	pop() {
		const popItem = this.head;
		this.head = this.head.next;
		this.length -= 1;
		return popItem.item;
	}
}

const input = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.trim());

const [D, N] = input.shift().split(' ');

let words = Array.from(Array(81), () => new Array());

input.forEach((word) => {
	const length = word.length;
	words[length].push(word);
});

let max = N;

const q = new Queue();

q.push(N);

while (q.length > 0) {
	const now = q.pop();

	const nowLength = now.length;
	words[nowLength + 1].forEach((next) => {
		// 한글자 차이인지 확인하고,
		// 확인되면 큐에 넣기
		if (check(now, next)) {
			if (next.length > max.length) {
				max = next;
			}
			q.push(next);
		}
	});
}
console.log(max);

function check(a, b) {
	let diff = 0;
	let j = 0;
	for (let i = 0; i < a.length; i++) {
		if (a[i] != b[j]) {
			diff++;
			i--;
		}
		if (diff == 2) {
			return false;
		}
		j++;
	}
	return true;
}