[baekjoon] 2002 추월 (Javascript)

2002번: 추월 (acmicpc.net)

2002번: 추월

---

접근 : 구현

 

Javascript

let input = require("fs")
  .readFileSync("input.txt") //"/dev/stdin"
  .toString()
  .split("\n")
  .map((val) => val.trim());
function solution(input) {
  let n = +input.shift();
  let carIn = [];
  let carOut = [];
  for (let i = 0; i < 2 * n; i++) {
    let car = input.shift();
    if (i < n) carIn.push(car);
    else carOut.push(car);
  }
  let answer = 0;
  for (let i = 0; i < carIn.length; i++) {
    if (carIn[i] !== carOut[i]) {
      answer++;
      carIn.splice(carIn.indexOf(carOut[i]), 1);
      carOut.splice(i, 1);
      i--;
    }
  }

  console.log(answer);
}

solution(input);