[백준알고리즘] 알고리즘 연습 - 1932

1932 - 정수 삼각형

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

let fs = require('fs');
let input = fs.readFileSync('/dev/stdin').toString().split('\n');

let count = input[0];
let numbers = [];

for (let i = 1; i < input.length; i++) {
  if (input[i] !== '') {
    numbers.push(input[i].split(" ").map((str) => Number(str)));
  }
}

for(var i=1; i<numbers.length; i++) {
    for(var j=0; j<numbers[i].length; j++) {
        numbers[i][j] += Math.max(numbers[i-1][j-1] || 0, numbers[i-1][j] || 0);
    }
}

console.log(Math.max(...numbers.pop()))