πŸ¦• 곡룑이 되자!

μž¬κ·€ν•¨μˆ˜ λ³Έλ¬Έ

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)
λ°˜μ‘ν˜•
Comments