[7.3] 비밀지도 알고리즘(48/100)

코딩테스트 연습 - [1차] 비밀지도 | 프로그래머스 (programmers.co.kr)

코딩테스트 연습 - [1차] 비밀지도

def binary(n, arr1):
  return_answer = []
  for i in arr1:
    answer = ''
    while True:
      if i < 2:
        answer += f'{i}'
        break
      else:
        answer += f'{i%2}'
        i //= 2
    if len(answer) < n:
      answer += '0' * (n-len(answer))
    answer = ''.join(reversed(answer))
    return_answer.append(answer)
  return return_answer


def solution(n, arr1, arr2):
    answer = []

    new_arr1 = []
    new_arr1 = binary(n, arr1)
    new_arr2 = []
    new_arr2 = binary(n, arr2)

    print(new_arr1)
    print(new_arr2)

    for i in range(n):
      line = ''
      for j in range(n):
        print(new_arr1[i][j])
        print(new_arr2[i][j])
        print()
        if new_arr1[i][j] == '0' and new_arr2[i][j] == '0':
          line += ' '
        else:
          line += '#'
      answer.append(line)
    return answer