๐ŸŒ  ๋ฌธ์ œ

์ •์ˆ˜ n์ด ์ฃผ์–ด์งˆ ๋•Œ, n์ดํ•˜์˜ ์ง์ˆ˜๋ฅผ ๋ชจ๋‘ ๋”ํ•œ ๊ฐ’์„ return ํ•˜๋„๋ก solution ํ•จ์ˆ˜๋ฅผ ์ž‘์„ฑํ•ด์ฃผ์„ธ์š”.

๐ŸŒ  ์ œํ•œ์‚ฌํ•ญ

  • 0 < n ≤ 1000

๐ŸŒ  ์ž…์ถœ๋ ฅ ์˜ˆ

10 30
4 6

๐ŸŒ  ์ž…์ถœ๋ ฅ ์˜ˆ ์„ค๋ช…

์ž…์ถœ๋ ฅ ์˜ˆ #1

  • n์ด 10์ด๋ฏ€๋กœ 2 + 4 + 6 + 8 + 10 = 30์„ return ํ•ฉ๋‹ˆ๋‹ค.

์ž…์ถœ๋ ฅ ์˜ˆ #2

  • n์ด 4์ด๋ฏ€๋กœ 2 + 4 = 6์„ return ํ•ฉ๋‹ˆ๋‹ค.

๐Ÿงž ํ’€์ด

function solution(n) {
    // ํ•ฉ์„ ๋‹ด์„ answer ์„ ์–ธ
    let answer = 0;
    // ๋ฐ˜๋ณต๋ฌธ ๋Œ๋ ค๊ฐ€๋ฉฐ ์ง์ˆ˜์ผ ๋•Œ๋งŒ answer์— ์ถ”๊ฐ€
    for (let i = 0; i <= n; i ++) {
        if (i % 2 == 0) {
            answer += i;
        }
    }
    // answer ๊ฐ’ ๋ฆฌํ„ด
    return answer;
}

+ Recent posts