๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
์•Œ๊ณ ๋ฆฌ์ฆ˜ ๐Ÿ’ก/ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์ค‘๋ณต๋œ ์ˆซ์ž ๊ฐœ์ˆ˜_ํŒŒ์ด์ฌ ํ’€์ด

by @ENFJ 2024. 6. 13.

https://school.programmers.co.kr/learn/courses/30/lessons/120583

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

 

def solution(array, n):
    n_count = 0
    for i in  array:
        # print(i)
        if (i == n):
            n_count += 1
    # print(n_count)
    return n_count

# ์˜ˆ์ œ ์‚ฌ์šฉ
print(solution([1, 1, 2, 3, 4, 5], 1))  # ๊ฒฐ๊ณผ: 2
print(solution([0, 2, 3, 4], 1))  # ๊ฒฐ๊ณผ: 0