김 양의 멋따라 개발따기
HackerRank - Simple Array Sum 본문
주어진 배열의 합을 구하는 문제
reduce 함수 이용 해서 풀이
풀이
'use strict';
import { WriteStream, createWriteStream } from "fs";
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString: string = '';
let inputLines: string[] = [];
let currentLine: number = 0;
process.stdin.on('data', function(inputStdin: string): void {
inputString += inputStdin;
});
process.stdin.on('end', function(): void {
inputLines = inputString.split('\n');
inputString = '';
main();
});
function readLine(): string {
return inputLines[currentLine++];
}
/*
* Complete the 'simpleArraySum' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER_ARRAY ar as parameter.
*/
function simpleArraySum(ar: number[]): number {
// Write your code here
return ar.reduce((a, b) => a + b)
}
function main() {
const ws: WriteStream = createWriteStream(process.env['OUTPUT_PATH']);
const arCount: number = parseInt(readLine().trim(), 10);
const ar: number[] = readLine().replace(/\s+$/g, '').split(' ').map(arTemp => parseInt(arTemp, 10));
const result: number = simpleArraySum(ar);
ws.write(result + '\n');
ws.end();
}
'알고리즘 풀이' 카테고리의 다른 글
HackerBank - Diagonal Difference (0) | 2024.03.24 |
---|