Development/CodingTest
μ¬κ·ν¨μ
Kirok Kim
2022. 1. 19. 18:57
- λ©μλ νΉμ ν¨μμ λ΄λΆμμ μκΈ°μμ μ λ©μλ νΉμ ν¨μλ₯Ό λ€μ νΈμΆνλ ν¨μ
-
#λ°λ³΅λ¬Έ νμ© μμ νμ data=[3,5,8] result =set() for i in range(2): for j in range(2): for k in range(2): result.add(data[0]*i+data[1]*j+data[2]*k) print(result) {0,3,5,8,11,13,16} #μ½λμ κ°κ²°ν λ° λ³μ μ΅μν #μ¬κ· ν¨μλ₯Ό νμ©ν μμ νμ def recur(index,value) if index==len(data): ## μ¬κ·ν¨μ μ’ λ£ κ΅¬λ¬Έ result.add(value) else: recur(index+1, value+data[index]) recur(index+1, value) result=set() recur(0,0) print(result) # ν©ν λ¦¬μΌ def factorial(n): if n==1: return 1 else: return n*factorial(n-1) #νΌλ³΄λμΉ μμ΄ def fivo(n): if n==0||n==1: return 1 else: return fivo(n-1) +fivo(n-2)
λ°μν