[알고리즘/백준/10798] 세로읽기

문제

---

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

10798번: 세로읽기

 

풀이

---

const input = require("fs")
  .readFileSync("/dev/stdin")
  .toString()
  .trim()
  .split("\n");
const maxLength = Math.max(...input.map(row => row.length));
let vertical = "";
for (let i = 0; i < maxLength; i++) {
  for (let j = 0; j < words.length; j++) {
    vertical += words[j][i] || "";
  }
}
console.log(vertical);