programmers | Lv1. ๋น„๋ฐ€์ง€๋„ [Python]

yeonkยท2022๋…„ 3์›” 1์ผ
0

algorithm

๋ชฉ๋ก ๋ณด๊ธฐ
59/88
post-thumbnail

๐Ÿ’ก Python 3






๐Ÿ”— ๋ฌธ์ œ

[1์ฐจ] ๋น„๋ฐ€์ง€๋„ [Link]






๐Ÿ’ป ๋‚ด ์ฝ”๋“œ

def solution(n, arr1, arr2):
    result = []
    for i in range(n):
        k = str(int(bin(arr1[i])[2:]) + int(bin(arr2[i])[2:]))
        if len(k) < n:
            k = '0'*(n - len(k)) + k
        a = ''
        for j in k:
            if j == '0': a += ' ' 
            else: a += '#' 
        result.append(a)
    return result






๐Ÿ’ฅ ๋‹ค๋ฅธ ์‚ฌ๋žŒ ์ฝ”๋“œ

rjust, zfill์— ๋Œ€ํ•ด ์•Œ์•„๊ฐ„๋‹ค!! ๋Œ€๋ฐ• !

def solution(n, arr1, arr2):
    answer = []
    for i,j in zip(arr1,arr2):
        a12 = str(bin(i|j)[2:])
        a12=a12.rjust(n,'0')
        a12=a12.replace('1','#')
        a12=a12.replace('0',' ')
        answer.append(a12)
    return answer






import re

def solution(n, arr1, arr2):
    answer = ["#"]*n
    for i in range(0, n):
        answer[i] = str(bin(arr1[i]|arr2[i]))[2:]
        answer[i] = re.sub('1', '#', '0'*(n-len(answer[i]))+answer[i])
        answer[i] = re.sub('0', ' ', answer[i])
    return answer






์ฐธ๊ณ  ์ž๋ฃŒ

ํŒŒ์ด์ฌ rjust, ljust, zfill

0๊ฐœ์˜ ๋Œ“๊ธ€