๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

๐Ÿ“š Algorithm/Programmers

Progammers ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - [๋‹ค์Œ ํฐ ์ˆซ์ž] Python ํŒŒ์ด์ฌ ํ’€์ด

๐Ÿ“ ๋ฌธ์ œ

 

 

 

 

๐Ÿšซ ์ œํ•œ ์‚ฌํ•ญ

 

 

 

โœ๏ธ ์ž…์ถœ๋ ฅ

 

 

 

๐Ÿ’ก ํ’€์ด

2์ง„์ˆ˜์—์„œ์˜ 1์˜ ๊ฐฏ์ˆ˜๋ฅผ ์„ธ์•ผํ•˜๊ธฐ ๋•Œ๋ฌธ์—, bin()๊ณผ .count("1")์„ ์‚ฌ์šฉํ–ˆ๋‹ค.

์กฐ๊ฑด1๊ณผ ์กฐ๊ฑด3์„ ๋™์‹œ์— ๋งŒ์กฑํ•˜๊ธฐ ์œ„ํ•ด์„œ ์ฃผ์–ด์ง„ n์—์„œ 1์”ฉ ๋Š˜๋ ค๊ฐ€๋ฉฐ ์กฐ๊ฑด2๋ฅผ ๋งŒ์กฑํ•  ๊ฒฝ์šฐ break๋ฅผ ๊ฑธ์—ˆ๋‹ค. 

 

def solution(n):
    answer = 0
    num = n+1
    while True :
        bin_n = bin(n)
        bin_num = bin(num)
        if bin_n.count("1") == bin_num.count("1") :
            answer = num
            break
        else :
            num += 1
            
    return answer

 

 

 

728x90