๊ด€๋ฆฌ ๋ฉ”๋‰ด

๐Ÿฆ• ๊ณต๋ฃก์ด ๋˜์ž!

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] Python N์œผ๋กœ ํ‘œํ˜„ ๋ณธ๋ฌธ

Development/CodingTest

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] Python N์œผ๋กœ ํ‘œํ˜„

Kirok Kim 2022. 2. 1. 22:40
def solution(N, number):
    answer = -1
    dp = [] # N ๊ฐฏ์ˆ˜ ํŒŒ์•… ์œ„ํ•œ ๋ฆฌ์ŠคํŠธ
    
    for i in range (1,9) : 
        result = set()      # ์—ฐ์‚ฐ ๊ฒฐ๊ณผ ๊ฐ’
        n2 = int(str(N)* i) # N์œผ๋กœ ๋งŒ๋“ค ์ˆ˜ ์žˆ๋Š” ์ˆซ์ž
        result.add(n2)
        
        for j in range(0,i-1): # ex) 3 = 2์—ฐ์‚ฐ1 ๋˜๋Š” 1์—ฐ์‚ฐ2 ๋˜๋Š” 3
            for op1 in dp[j]:
                for op2 in dp[-j-1] :
                    result.add(op1 - op2)
                    result.add(op1 + op2)
                    result.add(op1 * op2)
                    if op2 != 0:
                        result.add(op1 // op2)
                        
        if number in result:
            answer = i
            break
            
        dp.append(result) # N ๊ฐฏ์ˆ˜ ํŒŒ์•… ์œ„ํ•œ ๋ฆฌ์ŠคํŠธ
        

    return answer
๋ฐ˜์‘ํ˜•
Comments