ποΈ Algorithm/β¬ νλ‘κ·Έλλ¨Έμ€
[Programmers] [Python] Level1_λͺ¨μκ³ μ¬
Dbswnstjd
2022. 3. 8. 04:54
https://programmers.co.kr/learn/courses/30/lessons/42840
μ½λ©ν μ€νΈ μ°μ΅ - λͺ¨μκ³ μ¬
μν¬μλ μνμ ν¬κΈ°ν μ¬λμ μ€λ§μ λλ€. μν¬μ μΌμΈλ°©μ λͺ¨μκ³ μ¬μ μν λ¬Έμ λ₯Ό μ λΆ μ°μΌλ € ν©λλ€. μν¬μλ 1λ² λ¬Έμ λΆν° λ§μ§λ§ λ¬Έμ κΉμ§ λ€μκ³Ό κ°μ΄ μ°μ΅λλ€. 1λ² μν¬μκ° μ°λ
programmers.co.kr
νμ΄
def solution(answers):
# κ°μ₯ λ§μ λ¬Έμ λ₯Ό λ§ν μ¬λμ λνλ΄λ 리μ€νΈ
answer = []
# μν¬μ 1
supo_1 = [1, 2, 3, 4, 5]
# μν¬μ 2
supo_2 = [2, 1, 2, 3, 2, 4, 2, 5]
# μν¬μ 3
supo_3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
# κ° μν¬μκ° λ§μ μλ₯Ό κΈ°λ‘νλ λ°°μ΄
cnt = [0, 0, 0]
# μ
λ ₯λ°μ λ΅μμ ν λλ‘ κ° μν¬μκ° μΌλ§λ λ§μλμ§ νμ
for i in range(len(answers)):
# μν¬μ 1μ 5λ₯Ό μ£ΌκΈ°λ‘ λ°λ³΅
if answers[i] == supo_1[i % 5]:
cnt[0] += 1
# μν¬μ 2λ 8μ μ£ΌκΈ°λ‘ λ°λ³΅
if answers[i] == supo_2[i % 8]:
cnt[1] += 1
# μν¬μ 3μ 10μ μ£ΌκΈ°λ‘ λ°λ³΅
if answers[i] == supo_3[i % 10]:
cnt[2] += 1
# κ°μ₯ λ§μ΄ λ§μΆ μ
max_cnt = max(cnt)
# κ°μ₯ λ§μ΄ λ§μΆ μ¬λμ λ°°μ΄μ λ΄κΈ°
for i in range(3):
# κ°μ₯ λ§μ΄ λ§μΆ μμ κ°μ cnt μμμ μΈλ±μ€λ₯Ό +1 νμ¬ answerμ λ΄κΈ°
if max_cnt == cnt[i]:
answer.append(i + 1)
return answer
print(solution([1, 3, 2, 4, 2, 2, 3, 1, 4, 5, 2, 3, 4]))