Node.js) 백준 1259번: 팰린드롬 수

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

1259번: 팰린드롬수

 

 

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

const answer = [];

input.forEach((v) => {
        if (v != 0) {
                const L = v.length;
                let front;
                let back;
                if (L % 2 == 0) {
                        front = v.substring(0, L / 2);
                        back = v.substring(L / 2);
                } else {
                        front = v.substring(0, L / 2);
                        back = v.substring(L / 2 + 1);
                }
                if (front == back.split('').reverse().join('')) answer.push('yes');
                else answer.push('no');
        }
});

console.log(answer.join('\n'));