[백준]10211번 Maximum Subarray with Node.js

const [T,...input] = require("fs").readFileSync("testInput.txt").toString().trim().split("\n");

let result = [];

const main = (i) => {
    let testCase = input[i*2+1].split(" ").map(Number);
  
    result.push(maxSubArray(testCase));
};

for(let i = 0; i < T; i++){
    main(i);
};

console.log(result.join("\n").toString());

function maxSubArray(nums) {
    //
    let maxSum = nums[0]; //총 최대값
    let currentSum = 0; //현재 최대값

    for(let i = 0; i < nums.length; i++){ 
        //
        currentSum = Math.max(nums[i], currentSum + nums[i]);
        maxSum = Math.max(currentSum, maxSum);
    };
    return maxSum;
};